Easily refutable subformulas of large random 3CNF formulas.

Uriel Feige Eran Ofek

Published in: Theory Comput. (2007)

Keyphrases

cnf formula
propositional formulas
np complete
randomly generated
sat problem
max sat
computational complexity
knowledge representation
object oriented
propositional logic
stable set