Phase transitions in the $q$-coloring of random hypergraphs.
Marylou GabriéVarsha DaniGuilhem SemerjianLenka ZdeborováPublished in: CoRR (2017)
Keyphrases
- phase transition
- random constraint satisfaction problems
- random instances
- randomly generated
- easy hard easy pattern
- constraint satisfaction
- combinatorial problems
- np complete
- hard problems
- satisfiability problem
- random sat
- deep structure
- sat problem
- graph coloring
- random graphs
- graph theory
- np complete problems
- cellular automata
- stochastic local search
- genetic algorithm