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

DOI10.3103/S0027132209040020MaRDI QIDQ2513077zbMATH OpenFDO

Authors Vadim V. Kochergin

Publication date 2 February 2015

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

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

Mathematics Subject Classification ID

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

Recommendations

• Complexity of certain systems of monomials in calculation by composition circuits
• On the complexity of calculating systems of monomials with restrictions on the powers of variables
• On the complexity of computation of a pair of monomials in two variables
• On the complexity of implementation of a system of two monomials by composition circuits
• scientific article; zbMATH DE number 2125608

Cites work

• scientific article; zbMATH DE number 6004867 (Why is no real title available?)
• scientific article; zbMATH DE number 6004943 (Why is no real title available?)
• scientific article; zbMATH DE number 3733258 (Why is no real title available?)
• scientific article; zbMATH DE number 3607492 (Why is no real title available?)
• scientific article; zbMATH DE number 609921 (Why is no real title available?)
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Maximal computational complexity of systems of elements of free Abelian group
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
• On the complexity of computation of a pair of monomials in two variables
• On the Evaluation of Powers and Monomials
• On vectorial addition chains

Cited in

(10)

• On Bellman's and Knuth's problems and their generalizations
• 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
• A simple proof for the upper bound of the computational complexity of three monomials in three variables
• Lower bounds on the graver complexity of M-fold matrices
• scientific article; zbMATH DE number 2125608 (Why is no real title available?)
• On the complexity of calculating systems of monomials with restrictions on the powers of variables
• THE COMPLEXITY OF IMPLEMENTATION OF A SYSTEM OF MONOMIALS IN TWO VARIABLES BY COMPOSITION CIRCUITS
• On the complexity of computation of a pair of monomials in two variables
• On the complexity of implementation of a system of three monomials of two variables by composition circuits

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

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