Efficient Generation of Minimal Length Addition Chains
- 1 January 1999
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 28 (4), 1247-1263
- https://doi.org/10.1137/s0097539795295663
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
This publication has 11 references indexed in Scilit:
- Efficient computation of addition chainsJournal de Théorie des Nombres de Bordeaux, 1994
- Addition chains — an erratic sequenceDiscrete Mathematics, 1993
- Addition chains using continued fractionsJournal of Algorithms, 1989
- Computing Sequences with Addition ChainsSIAM Journal on Computing, 1981
- Addition Chain Methods for the Evaluation of Specific PolynomialsSIAM Journal on Computing, 1980
- Addition chains and solutions of l(2n) = l(n) and l(2n − 1) = n + l(n) − 1Discrete Mathematics, 1976
- A lower bound for the length of addition chainsTheoretical Computer Science, 1975
- The Scholz-Brauer problem on addition chainsPacific Journal of Mathematics, 1973
- Remarks on number theory III. On addition chainsActa Arithmetica, 1960
- On addition chainsBulletin of the American Mathematical Society, 1939