Sciweavers

123
Voted
CC
2010
Springer
112views System Software» more  CC 2010»
14 years 3 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 r...
Eli Ben-Sasson, Russell Impagliazzo