Work

Phase transitions and computational difficulty in random constraint satisfaction problems

Year: 2008

Type: conference-paper

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. 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.

Source: Journal of Physics Conference Series

DOI: 10.1088/1742-6596/95/1/012012

Authors: F Krząkała, L Zdeborová

Institutions: Université Paris-Sud, Centre National de la Recherche Scientifique, Laboratoire de Physique Théorique et Modèles Statistiques, Gulliver

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W1986274285

FWCI: 0.515

Cites: 37

Cited by: 11

Related to: