IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
From MaRDI portal
Publication:5151088
DOI10.17223/20710410/38/10OpenAlexW2778620382MaRDI QIDQ5151088
D. V. Kochergin, Vadim V. Kochergin
Publication date: 16 February 2021
Published in: Prikladnaya diskretnaya matematika (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/pdm600
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Calculating optimal addition chains
- Some results on addition/subtraction chains
- A lower bound for the length of addition chains
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
- A Generalization of Addition Chains and Fast Inversions in Binary Fields
- A Survey of Fast Exponentiation Methods
- Efficient Generation of Minimal Length Addition Chains
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
- An application of the method of additive chains to inversion in finite fields
- Remarks on number theory III. On addition chains
- On addition chains
This page was built for publication: IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION