Monotone classes beyond VNP
From MaRDI portal
Cites work
- A \(\tau \)-conjecture for Newton polygons
- A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant
- A lower bound on the number of additions in monotone computations
- A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials
- scientific article; zbMATH DE number 6820278 (Why is no real title available?)
- scientific article; zbMATH DE number 7829271 (Why is no real title available?)
- Lower bounds for monotone arithmetic circuits via communication complexity
- Monotone circuit lower bounds from robust sunflowers
- Monotone projection lower bounds from extended formulation lower bounds
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors
- Negation can be exponentially powerful
- On the depth complexity of formulas
- Robustly separating the arithmetic monotone hierarchy via graph inner-product
- Separating monotone VP and VNP
- Shadows of newton polytopes
- Small space analogues of Valiant's classes and the limitations of skew formulas
- Some Exact Complexity Results for Straight-Line Computations over Semirings
- Strongly Exponential Separation between Monotone VP and Monotone VNP
- Succinct algebraic branching programs characterizing non-uniform complexity classes
- The complexity of monotone computations of polynomials
- VPSPACE and a transfer theorem over the complex field
- VPSPACE and a transfer theorem over the reals
This page was built for publication: Monotone classes beyond VNP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951729)
