Sciweavers

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

27

STOC
1992
ACM

favoriteEmaildiscussreport

89views Algorithms» more STOC 1992»

Exponential Lower Bounds for the Pigeonhole Principle

14 years 3 months ago

Exponential Lower Bounds for the Pigeonhole Principle

Download www.cs.washington.edu

Paul Beame, Russell Impagliazzo, Jan Krajíc

Real-time Traffic

Algorithms | STOC 1992 |

claim paper

Related Content

» Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

» Regular resolution lower bounds for the weak pigeonhole principle

» BoundedDepth Frege Lower Bounds for Weaker Pigeonhole Principles

» Resolution lower bounds for the weak pigeonhole principle

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

» Dual weak pigeonhole principle Boolean complexity and derandomization

» Resolution over linear equations and multilinear proofs

» Hardness of Parameterized Resolution

» Algebraic Proofs over Noncommutative Formulas

Post Info
More Details (n/a)

Added	11 Aug 2010
Updated	11 Aug 2010
Type	Conference
Year	1992
Where	STOC
Authors	Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods

Comments (0)