Sciweavers

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

29

Voted

CSL
1997
Springer

favoriteEmaildiscussreport

88views Automated Reasoning» more CSL 1997»

Resolution and the Weak Pigeonhole Principle

14 years 3 months ago

Resolution and the Weak Pigeonhole Principle

Download euclid.ucsd.edu

Samuel R. Buss, Toniann Pitassi

Real-time Traffic

Automated Reasoning | CSL 1997 |

claim paper

Related Content

» Regular resolution lower bounds for the weak pigeonhole principle

» 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

» Tree Resolution Proofs of the Weak PigeonHole Principle

» A New Proof of the Weak Pigeonhole Principle

» Dual weak pigeonhole principle Boolean complexity and derandomization

» On Independence of Variants of the Weak Pigeonhole Principle

» The polynomial and linear hierarchies in models where the weak pigeonhole principle fails

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	CSL
Authors	Samuel R. Buss, Toniann Pitassi

Comments (0)