Remarks on number theory III. On addition chains
From MaRDI portal
Publication:5623778
DOI10.4064/aa-6-1-77-81zbMath0219.10064OpenAlexW1524626384MaRDI QIDQ5623778
Publication date: 1960
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/206704
Related Items
Complexity of computation in finite fields, Addition chains, vector chains, and efficient computation, IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION, Theoretical computer science. Cumulative index, volumes 1-100 (1992), How to compute modular exponentiation with large operators based on the right-to-left binary algorithm, Addition chains and solutions of \(\ell(2n)=\ell(n)\) and \(\ell(2^n-1)= n+\ell(n)-1\), Complexity measures and hierarchies for the evaluation of integers and polynomials, On Bellman's and Knuth's problems and their generalizations, Speeding up the computations on an elliptic curve using addition-subtraction chains, Fast Exponentiation Using Data Compression, Comparing the computational complexity of monomials and elements of finite abelian groups, Addition chains -- an erratic sequence, Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
