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...
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...
Nathan Segerlind, Samuel R. Buss, Russell Impaglia...
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...
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...