Relaxation in graph coloring and satisfiability problems
Pontus Svenson, Mats G. Nordahl
Abstract
Using T=0 Monte Carlo simulation, we study the relaxation of graph coloring (K-COL) and satisfiability (K-SAT), two hard problems that have recently been shown to possess a phase transition in solvability as a parameter is varied. A change from exponentially fast to power law relaxation, and a transition to freezing behavior are found. These changes take place for smaller values of the parameter than the solvability transition. Results for the coloring problem for colorable and clustered graphs and for the fraction of persistent spins for satisfiability are also presented.
Create a lesson
Related papers
Low-temperature magnetism and spin dynamics in the disordered triangular-lattice Yb3+ compound LiCaYb5(BO3)6
Monika Jawale, Saikat Nandi, Prashanta K. Mukharjee et al.
Neural Renormalization Group Flow for Percolation
Anaclara Alvez, Luca Camagna, Sergio Chibbaro et al.
Dynamical phase selection controls compute scaling in looped transformers
Gunn Kim
Semi-localized ground state in a 1D system with long-range hopping
Murod S. Bahovadinov, Faridun N. Jalolov, Vladimir E. Kravtsov et al.
Defect states in three-dimensional diamond photonic band gap crystals
Julia Rocha, Bart A. van Tiggelen, Ad Lagendijk et al.
Disorder-induced conducting edges on Kagomé lattice
A. Chmeruk, D. Jones, L. Chioncel