The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 28 NO.4 / (1999))
Efficient Generation of Minimal Length Addition Chains
Edward G. Thurber,
Pages. 1247-1263
Abstract
Contents 1. Introduction
2. Preliminaries
3. The search tree
4. Algorithm for finding all minimal addition chains
5. Pruning bounds (class 1)
6. Class 1 bounds refined
7. Pruning bounds (class 2)
8. Pruning bounds applied
9. Pruning bounds (class 1 further refined); the $2^i+1$ phenomenon
10. Some test results
11. Conclusion
Key words ddition chain, search tree, pruning bounds, backtracking, branch and bound
Mathmatical Subject Classification 11Y16, 11Y55, 68Q25