11 search results - page 1 / 3 » A New Proof of the Weak Pigeonhole Principle |
JCSS
2002
13 years 4 months ago
2002
The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, Paris, Wilkieand Woods 16] showed ho...
ICALP
2001
Springer
13 years 9 months 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...
COCO
2001
Springer
13 years 9 months ago
2001
Springer
STOC
2002
ACM
14 years 4 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).
APAL
2004
13 years 4 months ago
2004
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...