16 search results - page 1 / 4 » Lower bounds for k-DNF resolution on random 3-CNFs |
STOC
2005
ACM
14 years 4 months ago
2005
ACM
We prove exponential lower bounds for the refutation of a random 3-CNF with linear number of clauses by k-DNF Resolution for k log n/ log log n. For this we design a specially ta...
FOCS
2002
IEEE
13 years 9 months ago
2002
IEEE
d abstract) Nathan Segerlind∗ Sam Buss† Russell Impagliazzo‡ We prove a new switching lemma that works for restrictions that set only a small fraction of the variables and i...
SAT
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
CC
2010
Springer
12 years 11 months ago
2010
Springer
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...
IANDC
2002
13 years 4 months ago
2002