Approximating The Satisfiability Threshold For Random K-Xor-Formulas.
Nadia CreignouHervé DaudéOlivier DuboisPublished in: Comb. Probab. Comput. (2003)
Keyphrases
- random sat
- cnf formula
- phase transition
- conjunctive normal form
- sat problem
- random instances
- propositional formulas
- satisfiability problem
- np complete
- randomly generated
- propositional logic
- boolean formula
- uniformly distributed
- database
- computational complexity
- threshold selection
- roc curve
- computational properties
- adaptive threshold
- mathematical formulas
- genetic algorithm