Improved generation of minimal addition chains

DOI10.1007/S00607-006-0170-6MaRDI QIDQ854698zbMATH OpenOpenAlexFDO

Authors Hatem M. Bahig

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

zbMATH Keywords

sortingbranch and bound algorithmAddition chainnonstar lower bound

Mathematics Subject Classification ID

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

Recommendations

• Star reduction among minimal length addition chains
• Efficient Generation of Minimal Length Addition Chains
• Efficient computation of addition chains
• Efficient generation of shortest addition-multiplication chains
• Calculating optimal addition chains

Cites work

• A Survey of Fast Exponentiation Methods
• Addition chains -- an erratic sequence
• Computing Sequences with Addition Chains
• Efficient Generation of Minimal Length Addition Chains
• Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
• Theoretical computer science. Cumulative index, volumes 1-100 (1992)

Cited in

(9)

• scientific article; zbMATH DE number 1946632 (Why is no real title available?)
• A new strategy for generating shortest addition sequences
• Star reduction among minimal length addition chains
• Addition chains, vector chains, and efficient computation
• scientific article; zbMATH DE number 4035133 (Why is no real title available?)
• Binary addition chain on EREW PRAM
• Efficient generation of shortest addition-multiplication chains
• Efficient computation of addition chains
• Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)

This page was built for publication: Improved generation of minimal addition chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854698)