On addition chains
From MaRDI portal
Publication:5775403
DOI10.1090/S0002-9904-1939-07068-7zbMath0022.11106OpenAlexW2027891921WikidataQ55953252 ScholiaQ55953252MaRDI QIDQ5775403
Publication date: 1939
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9904-1939-07068-7
Related Items
Fast cryptography in genus 2, Rectifier Circuits of Bounded Depth, Complexity of computation in finite fields, On Addition Chains1, Fast Point Decompression for Standard Elliptic Curves, Calculating optimal addition chains, A study of some addition chain problems, IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION, Efficient computation of roots in finite fields, ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS, Addition chains and solutions of \(\ell(2n)=\ell(n)\) and \(\ell(2^n-1)= n+\ell(n)-1\), On Bellman's and Knuth's problems and their generalizations, Integer complexity: algorithms and computational results, Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication, Shorter addition chain for smooth integers using decomposition method, A simple proof for the upper bound of the computational complexity of three monomials in three variables, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten, 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, A Note on the Scholz-Brauer Problem in Addition Chains
