Sciweavers

AML
2004
78views more  AML 2004»
13 years 11 months ago
Matrix identities and the pigeonhole principle
We show that short bounded-depth Frege proofs of matrix identities, such as P Q = I QP = I (over the field of two elements), imply short bounded-depth Frege proofs of the pigeonho...
Michael Soltys, Alasdair Urquhart
COCO
1999
Springer
79views Algorithms» more  COCO 1999»
14 years 3 months ago
Non-Automatizability of Bounded-Depth Frege Proofs
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that bounded-depth Frege proofs do not have feasible interpolation, assuming that factoring...
Maria Luisa Bonet, Carlos Domingo, Ricard Gavald&a...
FOCS
2002
IEEE
14 years 4 months ago
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles
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...