Searching for "Lower Bounds for Monotone Span Programs" – sorted by Relevance.
-
Lower Bounds for Monotone Span Programs
- BRICS Basic Research in Computer Science Lower Bounds for Monotone Span Programs Amos Beimel Anna G
- Cited by 32 (5 self) – Add To MetaCart
-
A Note on Monotone Complexity and the Rank of Matrices
- associated with these structures gives lower bounds on monotone span program size and monotone formula size
- Add To MetaCart
-
Separating the Power of Monotone Span Programs over Different Fields
- super-polynomial lower bound for monotone span programs for a function in uniform NC 2 (and therefore
- Cited by 4 (2 self) – Add To MetaCart
-
Combinatorial Methods In Boolean Function Complexity
- provides lower bounds for monotone span programs, a v model introduced in 1993 by Karchmer and Wigderson
- Cited by 9 (1 self) – Add To MetaCart
-
Algebraic Models of Computation and Interpolation for Algebraic Proof Systems
- lower bounds on Nullstellensatz proofs using lower bounds on monotone span program complexity, but due
- Cited by 22 (2 self) – Add To MetaCart
-
Monotone Complexity and the Rank of Matrices
- this will also follow from the lower bounds on monotone span programs below using well-known simulations
- Cited by 2 (0 self) – Add To MetaCart
-
On the Spectrum of Projective Norm-Graphs
- Computer Science providing superpolynomial lower bounds for monotone span programs [8]. In this short note
- Cited by 6 (0 self) – Add To MetaCart
-
On reducibility and symmetry of disjoint NP-pairs
- bounds on monotone computation models, with the exception of Andrejev's, are in fact lower bounds
- Cited by 17 (0 self) – Add To MetaCart

