A spectral technique for random satisfiable 3CNF formulas.
Abraham FlaxmanPublished in: Random Struct. Algorithms (2008)
Keyphrases
- cnf formula
- np complete
- sat problem
- max sat
- truth assignment
- randomly generated
- conjunctive normal form
- propositional formulas
- davis putnam
- knowledge compilation
- randomly chosen
- satisfiability problem
- sat solvers
- databases
- phase transition
- search algorithm
- artificial intelligence
- database
- branch and bound algorithm
- branch and bound
- genetic algorithm