Counting Satisfiable k-CNF Formulas.

Mitchell A. Harris

Published in: CP (2001)

Keyphrases

cnf formula
np complete
max sat
sat problem
knowledge compilation
conjunctive normal form
davis putnam
satisfiability problem
constraint satisfaction problems
phase transition
sat solvers
truth assignment
computational complexity
branch and bound algorithm
orders of magnitude
np hard
lower bound