A new strategy for generating shortest addition sequences
From MaRDI portal
Publication:644844
DOI10.1007/S00607-010-0119-7zbMath1257.68141OpenAlexW2005190878MaRDI QIDQ644844
Hatem M. Bahig, Hazem M. Bahig
Publication date: 7 November 2011
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-010-0119-7
branch and bound algorithmaddition chainsaddition sequenceshigh performance arithmeticmonomial evaluationvectorial addition chains
Symbolic computation and algebraic computation (68W30) Nonnumerical algorithms (68W05) Calculation of integer sequences (11Y55)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved generation of minimal addition chains
- Theoretical computer science. Cumulative index, volumes 1-100 (1992)
- Integers with a small number of minimal addition chains
- Efficient computation of addition chains
- The Scholz-Brauer problem on addition chains
- Computing Sequences with Addition Chains
- On vectorial addition chains
- A method for obtaining digital signatures and public-key cryptosystems
- 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
- Addition chains using continued fractions
- Some properties of vectorial addition chains†
This page was built for publication: A new strategy for generating shortest addition sequences
