Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems

DOI10.1134/S1990478915010081zbMath1324.68052MaRDI QIDQ5264769

Vadim V. Kochergin

Publication date: 27 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

addition chainBellman's problemKnuth's problemevaluation of monomialsevaluation of powers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Arithmetic codes (94B40)

Related Items (4)

On some measures of complexity of finite abelian groups ⋮ IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ Comparing the computational complexity of monomials and elements of finite abelian groups

Cites Work

• On the complexity of computations on monomials and tuples of powers
• On the computation of powers sets
• On the Evaluation of Powers and Monomials
• Computing Sequences with Addition Chains
• On vectorial addition chains
• On the Evaluation of Powers
• A Survey of Fast Exponentiation Methods
• On the complexity of computation of a pair of monomials in two variables
• Remarks on number theory III. On addition chains
• On addition chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems