Relation between two measures of the computation complexity for systems of monomials

DOI10.3103/S0027132209040020zbMath1304.68075MaRDI QIDQ2513077

Vadim V. Kochergin

Publication date: 2 February 2015

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Number-theoretic algorithms; complexity (11Y16) Basic linear algebra (15A99)

Related Items (4)

Complexity of certain systems of monomials in calculation by composition circuits ⋮ On the complexity of implementation of a system of two monomials by composition circuits ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ A simple proof for the upper bound of the computational complexity of three monomials in three variables

Cites Work

• On the Evaluation of Powers and Monomials
• On vectorial addition chains
• On the complexity of computation of a pair of monomials in two variables
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Relation between two measures of the computation complexity for systems of monomials