Improved generation of minimal addition chains

DOI10.1007/S00607-006-0170-6zbMATH Open1140.11357OpenAlexW2123842954MaRDI QIDQ854698FDOQ854698

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

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

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)

Cites Work

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

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS
• A new strategy for generating shortest addition sequences
• Star reduction among minimal length addition chains
• Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\)
• Efficient computation of addition chains
• Addition chains, vector chains, and efficient computation

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)