SIAMCOMP
2000
13 years 4 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
FOCS
1998
IEEE
13 years 8 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...