Sciweavers

Share
CC
2010
Springer

Random Cnf's are Hard for the Polynomial Calculus

10 years 6 months ago
Random Cnf's are Hard for the Polynomial Calculus
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
Added 28 May 2011
Updated 28 May 2011
Type Journal
Year 2010
Where CC
Authors Eli Ben-Sasson, Russell Impagliazzo
Comments (0)
books