Sciweavers

3 search results - page 1 / 1
» On the Relative Complexity of Resolution Refinements and Cut...
Sort
View
SIAMCOMP
2000
86views more  SIAMCOMP 2000»
13 years 3 months ago
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 refuta...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 1 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
SAT
2007
Springer
118views Hardware» more  SAT 2007»
13 years 9 months ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
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...
Arist Kojevnikov