Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold
The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
Many NP‐complete constraint satisfaction problems appear to undergo a “phase transition” from solubility to insolubility when the constraint density passes through a critical threshold. In all such cases it is easy to derive upper bounds on the location of the threshold by showing that above a certain density the first moment (expectation) of the number of solutions tends to zero. We show that in the case of certain symmetric constraints, considering the second moment of the number of solutions yields nearly matching lower bounds for the location of the threshold. Specifically, we prove that the threshold for both random hypergraph 2‐colorability (Property B) and random Not‐All‐Equal k‐SAT is $2^{k-1}\ln 2 -O(1)$. As a corollary, we establish that the threshold for random k‐SAT is of order $\Theta(2^k)$, resolving a long‐standing open problem.
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 · cited 2×
“A more modern problem, with a somewhat similar flavor, is Boolean Satisfiability: given a CNF formula F , is it possible to assign truth values to the variables of F so that it evaluates to true? Satisfiability has been the central problem of computational complexity since 1971 when Cook [21] proved that it is complet…”
BackgroundSpencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Łuczak, T., Janson, S., & Ruciński, A. (2000) · Cited by 2,192
Asymptotic methods in analysis
de Bruijn, N. G. (1958) · International Linear Collider · Cited by 1,332
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 · cited 3×
“Indeed, this is precisely the picture suggested by some very recent, ground-breaking work of Mezard, Parisi, and Zecchina [46, 47], based on non-rigorous techniques of statistical physics.”
BackgroundWhere 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
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
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
Many hard examples for resolution
Chvátal, V., & Szemerédi, E. (1988) · Journal of the ACM · doi:10.1145/48014.48016 · Cited by 439 · cited 2×
“In [2], Achlioptas, Beame and Molloy extended the main result of [20] to random CNF formulas that also contain 2-clauses, as this is relevant for the behavior of Davis-Putnam (DPLL) algorithms on random k-CNF.”
BackgroundStatistical 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 302
Mick Gets Some (the Odds Are on His Side)
Chvátal, V., & Reed, B. A. (1992) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 242
A Threshold for Unsatisfiability
Goerdt, A. (1996) · Journal of Computer and System Sciences · doi:10.1006/jcss.1996.0081 · Cited by 241
The two possible values of the chromatic number of a random graph
Achlioptas, D., & Naor, A. (2005) · Annals of Mathematics · doi:10.4007/annals.2005.162.1335 · Cited by 188
Self-citationThe first cycles in an evolving graph
Flajolet, P., Knuth, D. E., & Pittel, B. G. (1989) · Discrete Mathematics · doi:10.1016/0012-365x(89)90087-3 · Cited by 108 · cited 1×
“In a random graph with cn edges this occurs with constant probability if and only if c < 1/2 (see [29] for more on the evolution of cycles in random graphs).”
BackgroundA sharp threshold in proof complexity
Achlioptas, D., Beame, P. W., & Molloy, M. S. O. (2001) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/380752.380820 · Cited by 77 · cited 2×
“In [2], Achlioptas, Beame and Molloy extended the main result of [20] to random CNF formulas that also contain 2-clauses, as this is relevant for the behavior of Davis-Putnam (DPLL) algorithms on random k-CNF.”
BackgroundResultSelf-citationThe chromatic numbers of random hypergraphs
Krivelevich, M., & Sudakov, B. (1998) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199807)12:4<381::aid-rsa5>3.0.co;2-p · Cited by 55
Setting 2 Variables at a Time Yields a New Lower Bound for Random 3-SAT
Achlioptas, D. (1999) · Cited by 47
Self-citationThe Chromatic Number of Random Regular Graphs
Achlioptas, D., & Moore, C. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27821-4_20 · Cited by 41 · cited 2×
“In [8], the method was successfully extended to random Max k-SAT, while in [9, 10] it was applied to random graph coloring.”
MethodSelf-citationTwo‐coloring random hypergraphs
Achlioptas, D., Kim, J. H., Krivelevich, M., & Tetali, P. (2002) · Random Structures and Algorithms · doi:10.1002/rsa.997 · Cited by 40 · cited 1×
“2 Random hypergraph 2-colorability While Bernstein [14] originally raised the 2-colorability question for certain classes of infinite set families, Erdős popularized the finite version of the problem [13, 26, 27, 42, 44, 50, 51] and the hypergraph representation.”
BackgroundSelf-citation
Cited by
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
Dell, H., & Van Melkebeek, D. (2014) · Journal of the ACM · doi:10.1145/2629620 · Cited by 159
“We know that the probability of satisfiability jumps from almost zero to almost one when the ratio m/n crosses a very narrow region around 2d ln 2, and the existence of a single threshold point is conjectured [Achlioptas and Moore 2007; Achlioptas and Peres 2004; Friedgut and Bourgain 1999].”
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
Boulebnane, S., & Montanaro, A. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030348 · Cited by 57
Metadata
- Authors
- Achlioptas, D., & Moore, C.
- Venue
- SIAM Journal on Computing
- Published
- 2006-01
- Volume
- 36
- Issue
- 3
- Pages
- 740-762
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2088419249
- Cited by
- 163
- References
- 20
- FWCI
- 17.95
- 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.