2 search results - page 1 / 1 » Non-Automatizability of Bounded-Depth Frege Proofs |
COCO
1999
Springer
13 years 9 months ago
1999
Springer
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...
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
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 ...