Typical random 3-SAT formulae and the satisfiability threshold
Olivier DuboisYacine BoufkhadJacques MandlerPublished in: CoRR (2002)
Keyphrases
- random sat
- phase transition
- satisfiability problem
- sat problem
- max sat
- random sat instances
- random constraint satisfaction problems
- np complete
- boolean satisfiability
- sat instances
- sat solvers
- temporal logic
- constraint satisfaction problems
- randomly generated
- davis putnam
- stochastic local search
- constraint satisfaction
- genetic algorithm
- branch and bound algorithm
- branch and bound
- random instances
- lower bound
- optimal solution