12 citations · 31 across the 12 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.DM2008
Satisfiability of Almost Disjoint CNF Formulas
Dominik Scheder
We call a CNF formula linear if any two clauses have at most one variable in common. Let m(k) be the largest integer m such that any linear k-CNF formula with <= m clauses is satis…
cs.DM2008★ 1 cited
Unsatisfiable CNF Formulas need many Conflicts
Dominik Scheder, Philipp Zumstein
A pair of clauses in a CNF formula constitutes a conflict if there is a variable that occurs positively in one clause and negatively in the other. A CNF formula without any conflic…