Efficient generation of minimal length addition chains
School of Science Technology and Health
An addition chain for a positive integer n is a set 1 = a0 < a1 < . . . < ar=n of integers such that for each $i\ge 1$, $a_i=a_j+a_k$ for some $k\le j n. Particular attention is paid to various pruning techniques that cut down the search time for such chains. Certain of these techniques are influenced by the multiplicative structure of n. Later sections of the paper present some results that have been uncovered by searching for minimal length addition chains.
addition chain, search tree, pruning bounds, backtracking, branch and bound
SIAM Journal on Computing
DOI of Published Version
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.
Thurber, Edward G., "Efficient generation of minimal length addition chains" (1999). Faculty Articles & Research. 657.