Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

STOC
2002
ACM

favoriteEmaildiscussreport

80views Algorithms» more STOC 2002»

Resolution lower bounds for the weak pigeonhole principle

14 years 11 months ago

Resolution lower bounds for the weak pigeonhole principle

Download www.cs.helsinki.fi

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

Real-time Traffic

Algorithms | STOC 2002 | Weak Pigeon Hole |

claim paper

Related Content

» Regular resolution lower bounds for the weak pigeonhole principle

» Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

» Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution

» Hardness of Parameterized Resolution

» Resolution over linear equations and multilinear proofs

» BoundedDepth Frege Lower Bounds for Weaker Pigeonhole Principles

» Tree Resolution Proofs of the Weak PigeonHole Principle

» Resolution and the Weak Pigeonhole Principle

» Exponential Lower Bounds for the Pigeonhole Principle

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Ran Raz

Comments (0)