We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
In this paper, a new class of Bayesian lower bounds is proposed. Derivation of the proposed class is performed via projection of each entry of the vector-function to be estimated ...
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi...