Short Propositional Refutations for Dense Random 3CNF Formulas.

Sebastian Müller Iddo Tzameret

Published in: LICS (2012)

Keyphrases

cnf formula
np complete
propositional formulas
knowledge compilation
truth assignment
max sat
conjunctive normal form
sat problem
propositional logic
randomly generated
neural network
satisfiability problem
randomly chosen
lower bound
phase transition
linear programming
object oriented
np hard