Improved generation of minimal addition chains
From MaRDI portal
Publication:854698
DOI10.1007/S00607-006-0170-6zbMath1140.11357OpenAlexW2123842954MaRDI QIDQ854698
Publication date: 6 December 2006
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-006-0170-6
Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Calculation of integer sequences (11Y55)
Related Items (5)
A new strategy for generating shortest addition sequences ⋮ Star reduction among minimal length addition chains ⋮ Addition chains, vector chains, and efficient computation ⋮ Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\) ⋮ EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS
Cites Work
- Theoretical computer science. Cumulative index, volumes 1-100 (1992)
- Addition chains -- an erratic sequence
- Computing Sequences with Addition Chains
- A Survey of Fast Exponentiation Methods
- Efficient Generation of Minimal Length Addition Chains
- Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
This page was built for publication: Improved generation of minimal addition chains
