12 search results - page 1 / 3 » Exponential Lower Bounds for the Pigeonhole Principle |
STOC
1992
ACM
13 years 11 months ago
1992
ACM
ICALP
2001
Springer
14 years 4 days ago
2001
Springer
We work with an extension of Resolution, called Res(2), that allows clauses with conjunctions of two literals. In this system there are rules to introduce and eliminate such conju...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
FOCS
2002
IEEE
14 years 18 days 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 ...
STOC
2002
ACM
14 years 8 months ago
2002
ACM
We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length (2n ), (for some global constant > 0).