Combining the k-CNF and XOR Phase-Transitions.
Jeffrey M. DudekKuldeep S. MeelMoshe Y. VardiPublished in: CoRR (2017)
Keyphrases
- phase transition
- constraint satisfaction
- satisfiability problem
- random constraint satisfaction problems
- sat problem
- np complete
- randomly generated
- combinatorial problems
- stochastic local search
- hard problems
- random instances
- random graphs
- sat instances
- graph coloring
- np complete problems
- deep structure
- conjunctive normal form
- sat solvers
- constraint satisfaction problems
- upper bound
- traveling salesman problem
- boolean satisfiability
- boolean functions
- cellular automata
- constraint programming