A lower bound for the length of addition chains

DOI10.1016/0304-3975(75)90008-0zbMath0307.68032OpenAlexW1985005492MaRDI QIDQ1218268

Arnold Schönhage

Publication date: 1975

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(75)90008-0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (14)

Probabilistic parallel prefix computation ⋮ Efficient computation of addition chains ⋮ Computing special powers in finite fields ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ On some measures of complexity of finite abelian groups ⋮ On-line evaluation of powers using Euclid's algorithm ⋮ Internal structure of addition chains: well-ordering ⋮ Addition chains, vector chains, and efficient computation ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ Speeding up the computations on an elliptic curve using addition-subtraction chains ⋮ On the additive complexity of some integer sequences ⋮ Some results on addition/subtraction chains ⋮ Addition chains -- an erratic sequence

This page was built for publication: A lower bound for the length of addition chains