On a generalization of addition chains: addition-multiplication chains

DOI10.1016/j.disc.2007.04.015zbMath1133.11070OpenAlexW2004852206MaRDI QIDQ2467743

Hatem M. Bahig

Publication date: 28 January 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.015

zbMATH Keywords

lower bounds of nonstar steps

Mathematics Subject Classification ID

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

Related Items (3)

Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS ⋮ Integer complexity: the integer defect

Cites Work

• Complexity measures and hierarchies for the evaluation of integers and polynomials
• Addition chains with multiplicative cost
• Integers with a small number of minimal addition chains
• Addition chains -- an erratic sequence
• Addition Chain Methods for the Evaluation of Specific Polynomials
• Computing Sequences with Addition Chains
• 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
• The cost of computing integers
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On a generalization of addition chains: addition-multiplication chains