8 search results - page 1 / 2 » Regular resolution lower bounds for the weak pigeonhole prin... |
STOC
2001
ACM
14 years 11 months ago
2001
ACM
ICALP
2001
Springer
14 years 3 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...
STOC
2002
ACM
14 years 11 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).
IANDC
2002
13 years 11 months ago
2002
ECCC
2010
13 years 9 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...