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

complexity of computationmonotone polynomialssemi-groupsemi-ringsparse sets

Mathematics Subject Classification ID

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

Review text

See the review in Zbl 0641.68057.

Cited in

(11)

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

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)