Efficient Generation of Minimal Length Addition Chains

DOI10.1137/S0097539795295663zbMath1007.11078OpenAlexW1970172343MaRDI QIDQ4268707

Edward G. Thurber

Publication date: 28 October 1999

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539795295663

zbMATH Keywords

branch and boundbacktrackingsearch treeaddition chainpruning bounds

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Calculation of integer sequences (11Y55)

Related Items (12)

Improved generation of minimal addition chains ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ A new strategy for generating shortest addition sequences ⋮ Calculating optimal addition chains ⋮ Star reduction among minimal length addition chains ⋮ Addition chains, vector chains, and efficient computation ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ On a generalization of addition chains: addition-multiplication chains ⋮ Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\) ⋮ On the complexity of the smallest grammar problem over fixed alphabets ⋮ EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS ⋮ Approximability of minimum AND-circuits

This page was built for publication: Efficient Generation of Minimal Length Addition Chains