The complexity of monotone computations of polynomials

MaRDI QIDQ1109563zbMATH OpenFDO

Authors S. B. Gashkov

Publication date 1987

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

zbMATH Keywords

sparse setssemi-ringcomplexity of computationsemi-groupmonotone polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Complexity of computation (including implicit computational complexity) (03D15)

Cited in

(10)

• Monotone classes beyond VNP
• Complexity of certain systems of monomials in calculation by composition circuits
• On the complexity of computations on monomials and tuples of powers
• On the complexity of the computation of certain classes of polynomials of several variables
• THE COMPLEXITY OF IMPLEMENTATION OF A SYSTEM OF MONOMIALS IN TWO VARIABLES BY COMPOSITION CIRCUITS
• Complexity of monotonic functions
• Adventures in monotone complexity and TFNP
• scientific article; zbMATH DE number 2125608 (Why is no real title available?)
• Degrees of monotone complexity
• Representation of monomials as a sum of powers of linear forms

This page was built for publication: The complexity of monotone computations of polynomials

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