Sciweavers

9 search results - page 1 / 2
» Lower Bounds for the Weak Pigeonhole Principle and Random Fo...
Sort
View
IANDC
2002
61views more  IANDC 2002»
13 years 5 months ago
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution
Albert Atserias, Maria Luisa Bonet, Juan Luis Este...
ICALP
2001
Springer
13 years 9 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...
STOC
2002
ACM
80views Algorithms» more  STOC 2002»
14 years 5 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
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