The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Critical Behavior in the Satisfiability of Random Boolean Expressions
Abstract
Determining the satisfiability of randomly generated Boolean expressions with k variables per clause is a popular test for the performance of search algorithms in artificial intelligence and computer science. It is known that for k = 2, formulas are almost always satisfiable when the ratio of clauses to variables is less than 1; for ratios larger than 1, the formulas are almost never satisfiable. Similar sharp threshold behavior is observed for higher values of k . Finite-size scaling, a method from statistical physics, can be used to characterize size-dependent effects near the threshold. A relationship can be drawn between thresholds and computational complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
Bollobás, B. (1985) · Cited by 6,196
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
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
A linear-time algorithm for testing the truth of certain quantified boolean formulas
Aspvall, B., Plass, M. F., & Tarjan, R. E. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90002-4 · Cited by 892
The birth of the giant component
Janson, S., Knuth, D. E., Łuczak, T., & Pittel, B. (1993) · Random Structures & Algorithms · doi:10.1002/rsa.3240040303 · Cited by 389
Generating hard satisfiability problems
Selman, B., Mitchell, D. G., & Levesque, H. J. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00045-3 · Cited by 296
Self-citationCooperative Solution of Constraint Satisfaction Problems
Clearwater, S. H., Huberman, B. A., & Hogg, T. (1991) · Science · doi:10.1126/science.254.5035.1181 · Cited by 154
Computational experience with an interior point algorithm on the satisfiability problem
Kamath, A. P., Karmarkar, N. K., Ramakrishnan, K. G., & Resende, M. G. C. (1990) · Annals of Operations Research · doi:10.1007/bf02283686 · Cited by 66
Cited by
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Pappu, R., Recht, B., Taylor, J., & Gershenfeld, N. (2002) · Science · doi:10.1126/science.1074376 · Cited by 2,018
Information, Physics, and Computation
Mézard, M., & Montanari, A. (2009) · doi:10.1093/acprof:oso/9780198570837.001.0001 · Cited by 1,913
Dall, J., & Christensen, M. (2002) · Physical Review E · doi:10.1103/physreve.66.016121 · Cited by 480
Survey propagation: An algorithm for satisfiability
Braunstein, A., Mézard, M., & Zecchina, R. (2005) · Random Structures & Algorithms · doi:10.1002/rsa.20057 · Cited by 433
Metadata
- Authors
- Kirkpatrick, S., & Selman, B.
- Venue
- Science
- Published
- 1994-05-27
- Volume
- 264
- Issue
- 5163
- Pages
- 1297-1301
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1968198053
- Cited by
- 589
- References
- 9
- FWCI
- 24.92
- 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: Critical Behavior in the Satisfiability of Random Boolean Expressions. https://app.cochat.ai/papers/10.1126/science.264.5163.1297
- The paper
- Kirkpatrick, S., & Selman, B. (1994). Critical Behavior in the Satisfiability of Random Boolean Expressions. Science. https://doi.org/10.1126/science.264.5163.1297
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.