IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
From MaRDI portal
Cites work
- A Generalization of Addition Chains and Fast Inversions in Binary Fields
- A lower bound for the length of addition chains
- A Survey of Fast Exponentiation Methods
- An application of the method of additive chains to inversion in finite fields
- Calculating optimal addition chains
- Efficient Generation of Minimal Length Addition Chains
- scientific article; zbMATH DE number 5529977 (Why is no real title available?)
- scientific article; zbMATH DE number 3607492 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 2077085 (Why is no real title available?)
- scientific article; zbMATH DE number 194333 (Why is no real title available?)
- scientific article; zbMATH DE number 4120283 (Why is no real title available?)
- Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman's and Knuth's problems
- On addition chains
- Remarks on number theory III. On addition chains
- Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
- Some results on addition/subtraction chains
- Speeding up the computations on an elliptic curve using addition-subtraction chains
Cited in
(2)
This page was built for publication: IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151088)
