Sciweavers

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

32

STOC
2001
ACM

favoriteEmaildiscussreport

116views Algorithms» more STOC 2001»

Regular resolution lower bounds for the weak pigeonhole principle

14 years 11 months ago

Regular resolution lower bounds for the weak pigeonhole principle

Download www.cs.helsinki.fi

Toniann Pitassi, Ran Raz

Real-time Traffic

Algorithms | STOC 2001 | Weak Pigeonhole Principle |

claim paper

Related Content

» Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

» Resolution lower bounds for the weak pigeonhole principle

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

» Hardness of Parameterized Resolution

» Resolution over linear equations and multilinear proofs

» The Efficiency of Resolution and DavisPutnam Procedures

» Algebraic Proofs over Noncommutative Formulas

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2001
Where	STOC
Authors	Toniann Pitassi, Ran Raz

Comments (0)