Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 163

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold

Achlioptas, Dimitris, Moore, Cristopher · 2006 · SIAM Journal on Computing

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0097539703434231

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 1 references

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold. https://app.cochat.ai/papers/10.1137/s0097539703434231
The paper
Achlioptas, D., & Moore, C. (2006). Random k‐SAT: Two Moments Suffice to Cross a Sharp Threshold. SIAM Journal on Computing. https://doi.org/10.1137/s0097539703434231

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.