6 citations · 6 across the 2 of their papers we have counts for
2 papers
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.DM2007★ 6 cited
Unsatisfiable Linear k-CNFs Exist, for every k
Dominik Scheder
We call a CNF formula linear if any two clauses have at most one variable in common. Let Linear k-SAT be the problem of deciding whether a given linear k-CNF formula is satisfiable…