The complexity of monotone computations of polynomials

zbMATH Open0655.68035MaRDI QIDQ1109563FDOQ1109563

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)

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

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)