Sciweavers

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

25

IANDC
2002

favoriteEmaildiscussreport

61views more IANDC 2002»

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

13 years 11 months ago

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

Download www.lsi.upc.edu

Albert Atserias, Maria Luisa Bonet, Juan Luis Este

Real-time Traffic

IANDC 2002 |

claim paper

Related Content

» Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution

» Regular resolution lower bounds for the weak pigeonhole principle

» Resolution lower bounds for the weak pigeonhole principle

» Dual weak pigeonhole principle Boolean complexity and derandomization

» The Efficiency of Resolution and DavisPutnam Procedures

» Hardness of Parameterized Resolution

» Algebraic Proofs over Noncommutative Formulas

» Hardness Amplification in Proof Complexity

Post Info
More Details (n/a)

Added	19 Dec 2010
Updated	19 Dec 2010
Type	Journal
Year	2002
Where	IANDC
Authors	Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban

Comments (0)