On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems

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 reso...

Full description

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 30; no. 5; pp. 1462 - 1484
Main Authors Bonet, Maria Luisa, Esteban, Juan Luis, Galesi, Nicola, Johannsen, Jan
Format Journal Article
LanguageEnglish
Published Philadelphia Society for Industrial and Applied Mathematics 01.01.2000
Subjects
Algorithms
Automation
Boolean
Circuits
Online AccessGet full text

Cover

Be the first to leave a comment!
You must be logged in first