Abstract: The two-coefficient minimum-adder graph (MAG2) algorithm is described and shown to be optimal. A partial implementation, optimal for pairs of integers up to 8 bits, outperforms the best ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback