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).

• Type: Conference
• Year: 2002
• Where: STOC
• Authors: Ran Raz
• Keywords: Algorithms, STOC 2002, Weak Pigeon Hole