2000 character limit reached
Phase Transitions and Computational Difficulty in Random Constraint Satisfaction Problems
Published 1 Nov 2007 in cs.CC and cond-mat.stat-mech | (0711.0110v1)
Abstract: We review the understanding of the random constraint satisfaction problems, focusing on the q-coloring of large random graphs, that has been achieved using the cavity method of the physicists. We also discuss the properties of the phase diagram in temperature, the connections with the glass transition phenomenology in physics, and the related algorithmic issues.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.