Sciweavers

57
Voted
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
15 years 10 months 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