On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas.

Vikraman Arvind Somenath Biswas

Published in: FSTTCS (1987)

Keyphrases

cnf formula
np complete
conjunctive normal form
knowledge compilation
max sat
propositional formulas
sat problem
constraint satisfaction problems
database
artificial intelligence
phase transition
satisfiability problem
sat solvers