12 search results - page 1 / 3 » On the Complexity of Unsatisfiability Proofs for Random k-CN... |
STOC
1998
ACM
13 years 9 months ago
1998
ACM
STACS
2010
Springer
13 years 12 months ago
2010
Springer
We call a CNF formula linear if any two clauses have at most one variable in common. We show that there exist unsatisfiable linear k-CNF formulas with at most 4k2 4k clauses, and ...
SIAMCOMP
2002
13 years 4 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
STOC
2010
ACM
14 years 2 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...