The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Rigorous location of phase transitions in hard optimization problems
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
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Every planar map is four colorable
Appel, K., & Haken, W. (1976) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1976-14122-5 · Cited by 1,109
Analytic and Algorithmic Solution of Random Satisfiability Problems
Mézard, M., Parisi, G., & Zecchina, R. (2002) · Science · doi:10.1126/science.1073287 · Cited by 1,071
Where the really hard problems are
Cheeseman, P. C., Kanefsky, B., & Taylor, W. M. (1991) · Cited by 1,004
Hard and easy distributions of SAT problems
Mitchell, D. G. M., Selman, B., & Levesque, H. J. (1992) · Cited by 799
Determining computational complexity from characteristic ‘phase transitions’
Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., & Troyansky, L. (1999) · Nature · doi:10.1038/22055 · Cited by 790
Sharp thresholds of graph properties, and the $k$-sat problem
Friedgut, E., & Jean Bourgain, A. B. (1999) · Journal of the American Mathematical Society · doi:10.1090/s0894-0347-99-00305-7 · Cited by 678
Critical Behavior in the Satisfiability of Random Boolean Expressions
Kirkpatrick, S., & Selman, B. (1994) · Science · doi:10.1126/science.264.5163.1297 · Cited by 589
RandomK-satisfiability problem: From an analytic solution to an efficient algorithm
Mézard, M., & Zecchina, R. (2002) · Physical Review E · doi:10.1103/physreve.66.056126 · Cited by 448
Application of statistical mechanics to NP-complete problems in combinatorial optimisation
Fu, Y., & Anderson, P. W. (1986) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/19/9/033 · Cited by 317
Every Planar Map is Four Colorable
Appel, K., & Haken, W. (1989) · Contemporary Mathematics · doi:10.1090/conm/098 · Cited by 290
Statistical mechanics of the random K -satisfiability model
Monasson, R., & Zecchina, R. (1997) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.56.1357 · Cited by 239
Random MAX SAT, random MAX CUT, and their phase transitions
Coppersmith, D., Gamarnik, D., Hajiaghayi, M., & Sorkin, G. B. (2004) · Random Structures and Algorithms · doi:10.1002/rsa.20015 · Cited by 79
Krząkała, F., Pagnani, A., & Weigt, M. (2004) · Physical Review E · doi:10.1103/physreve.70.046705 · Cited by 67
Random MAX SAT, Random MAX CUT, and Their Phase TransitionsPreprint
Coppersmith, D., Gamarnik, D., Hajiaghayi, M., & Sorkin, G. B. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0306047 · Cited by 47
Gomes, C. P., & Selman, B. (2002) · Science · doi:10.1126/science.1074599 · Cited by 18
Cited by
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Handbook of Knowledge Representation
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)x0300-6 · Cited by 883
Improved evolutionary optimization from genetically adaptive multimethod search
Vrugt, J. A., & Robinson, B. A. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0610471104 · Cited by 614
Cross-disciplinary perspectives on meta-learning for algorithm selection
Smith-Miles, K. A. (2009) · ACM Computing Surveys · doi:10.1145/1456650.1456656 · Cited by 552
Metadata
- Authors
- Achlioptas, D., Naor, A., & Peres, Y.
- Venue
- Nature
- Published
- 2005-06
- Volume
- 435
- Issue
- 7043
- Pages
- 759-764
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2152182443
- Cited by
- 279
- References
- 16
- FWCI
- 21.66
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.