A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
2000
SIAM journal on computing (Print)
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 refutations is proved. This implies an exponential separation between the tree-like versions and the dag-like versions of resolution and cutting planes. In both cases only superpolynomial separations were known [In order to prove these separations, the lower bounds on the depth of monotone circuits of Raz and McKenzie in
doi:10.1137/s0097539799352474
fatcat:xiyrppe6vvc6zakntfetsrjcdu