The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Landscape analysis of constraint satisfaction problems
Open accessAbstract
We discuss an analysis of constraint satisfaction problems, such as sphere packing, K-SAT, and graph coloring, in terms of an effective energy landscape. Several intriguing geometrical properties of the solution space become in this light familiar in terms of the well-studied ones of rugged (glassy) energy landscapes. A benchmark algorithm naturally suggested by this construction finds solutions in polynomial time up to a point beyond the clustering and in some cases even the thermodynamic transitions. This point has a simple geometric meaning and can be in principle determined with standard statistical mechanical methods, thus pushing the analytic bound up to which problems are guaranteed to be easy. We illustrate this for the graph 3- and 4-coloring problem. For packing problems the present discussion allows to better characterize the J-point, proposed as a systematic definition of random close packing, and to place it in the context of other theories of glasses.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications
Mezard, M., Parisi, G., & Virasoro, M. (1986) · World Scientific Lecture Notes in Physics · doi:10.1142/0271 · Cited by 3,653
Cited by
A phase diagram for jammed matter
Song, C., Wang, P., & Makse, H. A. (2008) · Nature · doi:10.1038/nature06981 · Cited by 964
Mean-field theory of hard sphere glasses and jamming
Parisi, G., & Zamponi, F. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.789 · Cited by 705
Fractal free energy landscapes in structural glasses
Charbonneau, P., Kurchan, J., Parisi, G., Urbani, P., & Zamponi, F. (2014) · Nature Communications · doi:10.1038/ncomms4725 · Cited by 484
Self-citationStatistical physics of inference: thresholds and algorithms
Zdeborová, L., & Krzakala, F. (2016) · Advances in Physics · doi:10.1080/00018732.2016.1211393 · Cited by 440
Self-citationPhase transitions in the coloring of random graphs
Zdeborová, L., & Krząkała, F. (2007) · Physical Review E · doi:10.1103/physreve.76.031131 · Cited by 306
Metadata
- Authors
- Krzakala, F., & Kurchan, J.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2007-08-27
- Volume
- 76
- Issue
- 2
- Pages
- 021122-021122
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2009472032
- Cited by
- 162
- References
- 1
- FWCI
- 21.53
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Landscape analysis of constraint satisfaction problems. https://app.cochat.ai/papers/10.1103/physreve.76.021122
- The paper
- Krzakala, F., & Kurchan, J. (2007). Landscape analysis of constraint satisfaction problems. Physical Review E. https://doi.org/10.1103/physreve.76.021122
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.