Unsatisfiable (k,(4*2^k/k))-CNF formulas

Published in: CoRR (2008)

Keyphrases

cnf formula
np complete
max sat
propositional formulas
sat problem
knowledge compilation
conjunctive normal form
davis putnam
np hard
databases
computational complexity
scheduling problem
constraint satisfaction problems
temporal logic
satisfiability problem