Title
Efficient generation of minimal length addition chains
School/Department
School of Science Technology and Health
Publication Date
1999
Abstract
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.
Keywords
addition chain, search tree, pruning bounds, backtracking, branch and bound
Publication Title
SIAM Journal on Computing
Volume
28
Issue
4
First Page
1247
Last Page
1263
DOI of Published Version
10.1137/S0097539795295663
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.
Recommended Citation
Thurber, Edward G., "Efficient generation of minimal length addition chains" (1999). Faculty Articles & Research. 657.
https://digitalcommons.biola.edu/faculty-articles/657