Phase Transitions of Dominating Clique Problem and Their Implications to Heuristics in Satisfiability Search.
Joseph C. CulbersonYong GaoCalin AntonPublished in: IJCAI (2005)
Keyphrases
- phase transition
- satisfiability problem
- stochastic local search
- random instances
- search algorithm
- constraint satisfaction
- hard problems
- random constraint satisfaction problems
- search strategies
- np complete
- search methods
- randomly generated
- combinatorial problems
- np complete problems
- sat problem
- search space
- graph coloring
- heuristic search
- search strategy
- search heuristics
- random sat
- search problems
- planning graph
- symmetry breaking
- sat instances
- heuristic function
- lower bound