A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.

Shlomo Hoory Stefan Szeider

Published in: SIAM J. Discret. Math. (2006)

Keyphrases

cnf formula
np complete
max sat
boolean formula
sat problem
knowledge compilation
propositional formulas
conjunctive normal form
davis putnam
truth assignment
satisfiability problem
constraint satisfaction problems
decision makers
sat solvers
randomly generated