Phase Transition for Maximum Not-All-Equal Satisfiability.
Junping ZhouShuli HuTingting ZouMinghao YinPublished in: FAW (2017)
Keyphrases
- phase transition
- satisfiability problem
- constraint satisfaction
- np complete
- sat problem
- random constraint satisfaction problems
- randomly generated
- combinatorial problems
- deep structure
- hard problems
- random instances
- graph coloring
- cellular automata
- average degree
- random sat
- relational learning
- stochastic local search
- boolean satisfiability
- random graphs
- constraint satisfaction problems
- similarity measure
- heuristic search
- search algorithm