The Planted Matching Problem: Phase Transitions and Exact Results.
Mehrdad MoharramiCristopher MooreJiaming XuPublished in: CoRR (2019)
Keyphrases
- phase transition
- constraint satisfaction
- random constraint satisfaction problems
- randomly generated
- satisfiability problem
- matching algorithm
- cellular automata
- random instances
- hard problems
- np complete
- random graphs
- sat problem
- graph coloring
- np complete problems
- stochastic local search
- combinatorial problems
- temporal logic