Sciweavers

STOC
2002
ACM

Resolution lower bounds for the weak pigeonhole principle

15 years 7 days ago
Resolution lower bounds for the weak pigeonhole principle
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).
Ran Raz
Added 03 Dec 2009
Updated 03 Dec 2009
Type Conference
Year 2002
Where STOC
Authors Ran Raz
Comments (0)