Strongly Exponential Separation between Monotone VP and Monotone VNP
From MaRDI portal
Publication:5862285
DOI10.1145/3417758zbMATH Open1495.68067arXiv1903.01630OpenAlexW2918305008WikidataQ115522528 ScholiaQ115522528MaRDI QIDQ5862285FDOQ5862285
Authors: Srikanth Srinivasan
Publication date: 7 March 2022
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
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
Full work available at URL: https://arxiv.org/abs/1903.01630
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}\)
Networks and circuits as models of computation; circuit complexity (68Q06) Communication complexity, information complexity (68Q11)
Cited In (6)
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)