On addition chains

DOI10.1090/S0002-9904-1939-07068-7MaRDI QIDQ5775403zbMATH OpenOpenAlexWikidataFDO

Authors Alfred Brauer

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

zbMATH Keywords

addition chains

Mathematics Subject Classification ID

Special sequences and polynomials (11B83)

Cited in

(22)

• Addition chains and solutions of \(\ell(2n)=\ell(n)\) and \(\ell(2^n-1)= n+\ell(n)-1\)
• Addition chains -- an erratic sequence
• On Bellman's and Knuth's problems and their generalizations
• A simple proof for the upper bound of the computational complexity of three monomials in three variables
• Efficient computation of roots in finite fields
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
• Fast cryptography in genus 2
• Shorter addition chain for smooth integers using decomposition method
• Fast Point Decompression for Standard Elliptic Curves
• Complexity of computation in finite fields
• A study of some addition chain problems
• On Addition Chains¹
• Rectifier circuits of bounded depth
• IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
• On the computational complexity of the Arnold complexity of binary words
• Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems
• Integer complexity: algorithms and computational results
• Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
• A Note on the Scholz-Brauer Problem in Addition Chains
• Calculating optimal addition chains
• On the additive complexity of some integer sequences
• A binary version of the Mahler-Popken complexity function

This page was built for publication: On addition chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5775403)