Sciweavers

16 search results - page 2 / 4
» Resolution and the Weak Pigeonhole Principle
Sort
View
COCO
2001
Springer
94views Algorithms» more  COCO 2001»
13 years 10 months ago
Tree Resolution Proofs of the Weak Pigeon-Hole Principle
Stefan S. Dantchev, Søren Riis
JCSS
2002
86views more  JCSS 2002»
13 years 5 months 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»
13 years 5 months 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
LOGCOM
2007
74views more  LOGCOM 2007»
13 years 5 months ago
On Independence of Variants of the Weak Pigeonhole Principle
The principle sPHPa b (PV (α)) states that no oracle circuit can compute a surjection of a onto b. We show that sPHP (a) P (a)(PV (α)) is independent of PV1(α)+sPHP π(a) Π(a)...
Emil Jerábek