Strongly Exponential Separation between Monotone VP and Monotone VNP
From MaRDI portal
(Redirected from Publication:5862285)
Abstract: We show that there is a sequence of explicit multilinear polynomials with non-negative coefficients that lies in monotone VNP such that any monotone algebraic circuit for must have size This builds on (and strengthens) a result of Yehudayoff (2018) who showed a lower bound of
Recommendations
- Separating monotone VP and VNP
- V-monotone independence
- scientific article; zbMATH DE number 934585
- Characterization of strong exponential dichotomies
- Strongly exponentially separated linear systems
- scientific article; zbMATH DE number 940746
- Separation of the monotone NC hierarchy
- Strongly exponential lower bounds for monotone computation
- On an exponential inequality and a strong law of large numbers for monotone measures
- A note on the monotonicity of \(V_{n}\)
Cited in
(9)- Separation of the monotone NC hierarchy
- Log-concavity and lower bounds for arithmetic circuits
- Monotone arithmetic complexity of graph homomorphism polynomials
- Monotone classes beyond VNP
- Monotone classes beyond VNP
- On approximate symmetric polynomials and tightness of homogenization results
- Monotone bounded-depth complexity of homomorphism polynomials
- \textsf{VNP} = \textsf{VP} in the multilinear world
- Monotone separations for constant degree polynomials
This page was built for publication: Strongly Exponential Separation between Monotone VP and Monotone VNP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5862285)