A simple proof for the upper bound of the computational complexity of three monomials in three variables

DOI10.3103/S0027132219020013zbMath1468.68108OpenAlexW2944466192MaRDI QIDQ2320000

Vadim V. Kochergin

Publication date: 21 August 2019

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132219020013

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• On Bellman's and Knuth's problems and their generalizations
• Relation between two measures of the computation complexity for systems of monomials
• On the Evaluation of Powers and Monomials
• On addition chains

This page was built for publication: A simple proof for the upper bound of the computational complexity of three monomials in three variables