3 search results - page 1 / 1 » Modular Coloring Formulas Are Hard for Cutting Planes Proofs |
STOC
1996
ACM
13 years 10 months ago
1996
ACM
STOC
2010
ACM
14 years 4 months ago
2010
ACM
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...
JAIR
2007
13 years 6 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...