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

DOI10.1134/S1990478915010081MaRDI QIDQ5264769zbMATH OpenFDO

Authors 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)

Recommendations

• On Bellman's and Knuth's problems and their generalizations
• On the complexity of computations on monomials and tuples of powers
• scientific article; zbMATH DE number 609921
• On Evaluation of Powers
• On the complexity of computation of a pair of monomials in two variables

Cites work

• scientific article; zbMATH DE number 3733258 (Why is no real title available?)
• scientific article; zbMATH DE number 56705 (Why is no real title available?)
• scientific article; zbMATH DE number 609921 (Why is no real title available?)
• scientific article; zbMATH DE number 609987 (Why is no real title available?)
• scientific article; zbMATH DE number 4120283 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• A Survey of Fast Exponentiation Methods
• Computing Sequences with Addition Chains
• On addition chains
• On the Evaluation of Powers
• On the Evaluation of Powers and Monomials
• On the complexity of computation of a pair of monomials in two variables
• On the complexity of computations on monomials and tuples of powers
• On the computation of powers sets
• On vectorial addition chains
• Remarks on number theory III. On addition chains

Cited in

(8)

• IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION
• On some measures of complexity of finite abelian groups
• On the Evaluation of Powers
• On the complexity of computations on monomials and tuples of powers
• scientific article; zbMATH DE number 4033074 (Why is no real title available?)
• Comparing the computational complexity of monomials and elements of finite abelian groups
• On Bellman's and Knuth's problems and their generalizations
• scientific article; zbMATH DE number 609921 (Why is no real title available?)

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)