19 search results - page 2 / 4 » Resolution lower bounds for the weak pigeonhole principle |
APAL
2008
13 years 7 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
FOCS
2002
IEEE
14 years 18 days ago
2002
IEEE
We prove a quasi-polynomial lower bound on the size of bounded-depth Frege proofs of the pigeonhole principle PHPm n where m ´1 · 1 polylog nµn. This lower bound qualitatively ...
COCO
2001
Springer
14 years 4 days ago
2001
Springer
CSL
1997
Springer
13 years 11 months ago
1997
Springer
STOC
1992
ACM
13 years 11 months ago
1992
ACM
