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

DOI10.1134/S1990478915010081zbMATH Open1324.68052MaRDI QIDQ5264769FDOQ5264769

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)

Cites Work

• On the Evaluation of Powers and Monomials
• On addition chains
• On vectorial addition chains
• Title not available (Why is that?)
• A Survey of Fast Exponentiation Methods
• Title not available (Why is that?)
• On the Evaluation of Powers
• Remarks on number theory III. On addition chains
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing Sequences with Addition Chains
• On the computation of powers sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of computation of a pair of monomials in two variables
• On the complexity of computations on monomials and tuples of powers

Cited In (7)

• Title not available (Why is that?)
• Comparing the computational complexity of monomials and elements of finite abelian groups
• Title not available (Why is that?)
• On the complexity of computations on monomials and tuples of powers
• On some measures of complexity of finite abelian groups
• On Bellman's and Knuth's problems and their generalizations
• IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264769)