Sciweavers

JCSS
2002
86views more  JCSS 2002»
15 years 8 days ago
A New Proof of the Weak Pigeonhole Principle
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...
Alexis Maciel, Toniann Pitassi, Alan R. Woods
APAL
2004
105views more  APAL 2004»
15 years 14 days ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
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...
Emil Jerábek
97
Voted
ICALP
2001
Springer
15 years 5 months ago
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
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...
Albert Atserias, Maria Luisa Bonet, Juan Luis Este...
85
Voted
STOC
2001
ACM
116views Algorithms» more  STOC 2001»
16 years 27 days ago
Regular resolution lower bounds for the weak pigeonhole principle
Toniann Pitassi, Ran Raz