Efficient generation of shortest addition-multiplication chains
DOI10.21608/JOEMS.2018.2691.1052zbMATH Open1452.68281OpenAlexW2909695226WikidataQ128635722 ScholiaQ128635722MaRDI QIDQ5220293FDOQ5220293
Authors: Hatem M. Bahig, A. E. A. Mahran 
Publication date: 16 March 2020
Published in: Journal of the Egyptian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21608/joems.2018.2691.1052
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Survey of Fast Exponentiation Methods
- Title not available (Why is that?)
- A fast parallel modular exponentiation algorithm
- Efficient Generation of Minimal Length Addition Chains
- Improved generation of minimal addition chains
- Integers with a small number of minimal addition chains
- Computing Sequences with Addition Chains
- A new strategy for generating shortest addition sequences
- Star reduction among minimal length addition chains
- Addition Chain Methods for the Evaluation of Specific Polynomials
- Complexity measures and hierarchies for the evaluation of integers and polynomials
- On a generalization of addition chains: addition-multiplication chains
Cited In (8)
- On a generalization of addition chains: addition-multiplication chains
- Title not available (Why is that?)
- Some properties of vectorial addition chains†
- Title not available (Why is that?)
- A new strategy for generating shortest addition sequences
- On the construction of short addition-subtraction chains and their applications
- Efficient computation of addition chains
- Improved generation of minimal addition chains
This page was built for publication: Efficient generation of shortest addition-multiplication chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220293)
