Sciweavers

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

19

CC
2010
Springer

favoriteEmaildiscussreport

112views System Software» more CC 2010»

Random Cnf's are Hard for the Polynomial Calculus

12 years 11 months ago

Random Cnf's are Hard for the Polynomial Calculus

Download reference.kfupm.edu.sa

We show a general reduction that derives lower bounds on degrees of polynomial calculus proofs of tautologies over any field of characteristic other than 2 from lower bounds for resolution proofs of a related set of linear equations modulo 2. We apply this to derive linear lower bounds on the degrees of PC proofs of randomly generated tautologies.

Eli Ben-Sasson, Russell Impagliazzo

Real-time Traffic

CC 2010 | Lower Bounds | Polynomial Calculus Proofs | Resolution Proofs | System Software |

claim paper

Related Content

» Hardness Amplification in Proof Complexity

» On Partial Lifting and the Elliptic Curve Discrete Logarithm Problem

Post Info
More Details (n/a)

Added	28 May 2011
Updated	28 May 2011
Type	Journal
Year	2010
Where	CC
Authors	Eli Ben-Sasson, Russell Impagliazzo

Comments (0)