The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Experimental results on the crossover point in random 3-SAT
Open accessOverview
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
A machine program for theorem-proving
Davis, M., Logemann, G., & Loveland, D. (1962) · Communications of the ACM · doi:10.1145/368273.368557 · Cited by 3,220
Smullyan, R. M. (1968) · Springer eBooks · doi:10.1007/978-3-642-86718-7 · Cited by 1,357
A new method for solving hard satisfiability problems
Selman, B., Levesque, H. J., & Mitchell, D. G. M. (1992) · Cited by 1,156
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Dowling, W. F., & Gallier, J. H. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90014-1 · Cited by 1,013
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
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
Many hard examples for resolution
Chvátal, V., & Szemerédi, E. (1988) · Journal of the ACM · doi:10.1145/48014.48016 · Cited by 439
Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method
Minton, S., Johnston, M., Philips, A. B., & Laird, P. D. (1990) · National Conference on Artificial Intelligence · Cited by 278
Improvements to propositional satisfiability search algorithms
Freeman, J. (1995) · Cited by 265
Cited by
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
Impagliazzo, R., & Paturi, R. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1727 · Cited by 1,002
Extending and implementing the stable model semantics
Simons, P., Niemelä, I., & Soininen, T. (2002) · Artificial Intelligence · doi:10.1016/s0004-3702(02)00187-x · Cited by 841
Logic programs with stable model semantics as a constraint programming paradigm
Niemelä, I. (1999) · Annals of Mathematics and Artificial Intelligence · doi:10.1023/a:1018930122475 · Cited by 834
Variations and extension of the convex–concave procedure
Lipp, T., & Boyd, S. (2016) · Optimization and Engineering · doi:10.1007/s11081-015-9294-x · Cited by 744
Metadata
- Authors
- Crawford, J. M., & Auton, L. D.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 1996-03
- Volume
- 81
- Issue
- 1-2
- Pages
- 31-57
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2155218845
- Cited by
- 290
- References
- 13
- FWCI
- 32.10
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Experimental results on the crossover point in random 3-SAT. https://app.cochat.ai/papers/10.1016/0004-3702(95)00046-1
- The paper
- Crawford, J. M., & Auton, L. D. (1996). Experimental results on the crossover point in random 3-SAT. Artificial Intelligence. https://doi.org/10.1016/0004-3702(95)00046-1
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.