The following pages link to On addition chains (Q5775403):
Displaying 20 items.
- Fast cryptography in genus 2 (Q271578) (← links)
- Complexity of computation in finite fields (Q378003) (← links)
- Calculating optimal addition chains (Q644848) (← links)
- Addition chains and solutions of \(\ell(2n)=\ell(n)\) and \(\ell(2^n-1)= n+\ell(n)-1\) (Q1233456) (← links)
- Addition chains -- an erratic sequence (Q1313870) (← links)
- On Bellman's and Knuth's problems and their generalizations (Q1791767) (← links)
- A simple proof for the upper bound of the computational complexity of three monomials in three variables (Q2320000) (← links)
- Efficient computation of roots in finite fields (Q2491305) (← links)
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten (Q2557099) (← links)
- Shorter addition chain for smooth integers using decomposition method (Q3101616) (← links)
- Fast Point Decompression for Standard Elliptic Curves (Q3506353) (← links)
- A study of some addition chain problems (Q3807322) (← links)
- On Addition Chains<sup>1</sup> (Q4032913) (← links)
- Rectifier Circuits of Bounded Depth (Q4553646) (← links)
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION (Q5151088) (← links)
- ON THE COMPUTATIONAL COMPLEXITY OF THE ARNOLD COMPLEXITY OF BINARY WORDS (Q5189966) (← links)
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems (Q5264769) (← links)
- Integer complexity: algorithms and computational results (Q5384256) (← links)
- Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication (Q5458208) (← links)
- A Note on the Scholz-Brauer Problem in Addition Chains (Q5818556) (← links)
