On the complexity of computation of a pair of monomials in two variables

DOI10.1515/156939205774939353zbMath1228.11181OpenAlexW2079544802MaRDI QIDQ5491252

Vadim V. Kochergin

Publication date: 10 October 2006

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

Full work available at URL: https://doi.org/10.1515/156939205774939353

zbMATH Keywords

addition chains

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Special sequences and polynomials (11B83)

Related Items

Complexity of certain systems of monomials in calculation by composition circuits, On Bellman's and Knuth's problems and their generalizations, Relation between two measures of the computation complexity for systems of monomials, Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems

Cites Work

• On the complexity of calculating systems of monomials with restrictions on the powers of variables
• Unnamed Item
• Unnamed Item