Phase Transitions in the Regular Random 3-SAT Problem.
Ramón BéjarFelip ManyàPublished in: ISMIS (1999)
Keyphrases
- phase transition
- sat problem
- random instances
- random sat
- randomly generated
- random constraint satisfaction problems
- satisfiability problem
- constraint satisfaction
- random sat instances
- sat instances
- boolean satisfiability
- np complete
- max sat
- hard problems
- combinatorial problems
- np complete problems
- stochastic local search
- propositional satisfiability
- graph coloring
- davis putnam
- random graphs
- genetic algorithm
- sat solvers
- combinatorial optimization