Login / Signup

Satisfiability Threshold for Random XOR-CNF Formulas.

Nadia CreignouHervé Daudé
Published in: Discret. Appl. Math. (1999)
Keyphrases
  • cnf formula
  • np complete
  • sat problem
  • randomly generated
  • max sat
  • conjunctive normal form
  • davis putnam
  • truth assignment
  • knowledge compilation
  • propositional formulas
  • satisfiability problem
  • np hard
  • search space