The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
On the Complexity of k-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
Spencer, J. (1991) · Medical Entomology and Zoology · Cited by 4,310
Which Problems Have Strongly Exponential Complexity?
Impagliazzo, R., Paturi, R., & Zane, F. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1774 · Cited by 1,331
Self-citationProceedings. 45th Annual IEEE Symposium on Foundations of Computer Science
(2004) · 45th Annual IEEE Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.4 · Cited by 805
Finding a Maximum Independent Set
Tarjan, R. E., & Trojanowski, A. E. (1977) · SIAM Journal on Computing · doi:10.1137/0206038 · Cited by 474
A probabilistic algorithm for k-SAT and constraint satisfaction problems
Schoning, T. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814612 · Cited by 433
Experimental results on the crossover point in random 3-SAT
Crawford, J. M., & Auton, L. D. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00046-1 · Cited by 290
Solving satisfiability in less than 2n steps
Monien, B., & Speckenmeyer, E. (1985) · Discrete Applied Mathematics · doi:10.1016/0166-218x(85)90050-2 · Cited by 253
Which problems have strongly exponential complexity?
Impagliazzo, R., Paturi, R., & Zane, F. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743516 · Cited by 179
Self-citationPaturi, R., Pudlák, P., & Zane, F. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646146 · Cited by 172
Self-citationAn improved exponential-time algorithm for k-SAT
Paturi, R., Pudlik, P., Saks, M., & Zane, F. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1998.743513 · Cited by 157
Self-citation
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Quantum computational supremacy
Harrow, A. W., & Montanaro, A. (2017) · Nature · doi:10.1038/nature23458 · Cited by 702
Exact Algorithms for NP-Hard Problems: A Survey
Woeginger, G. J. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36478-1_17 · Cited by 652
Computing a nonnegative matrix factorization -- provably
Arora, S., Ge, R., Kannan, R., & Moitra, A. (2012) · Proceedings of the forty-fourth annual ACM symposium on Theory of computing · doi:10.1145/2213977.2213994 · Cited by 280
Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems
Abboud, A., & Williams, V. V. (2014) · 2014 IEEE 55th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.53 · Cited by 268
Improving Exhaustive Search Implies Superpolynomial Lower Bounds
Williams, R. (2013) · SIAM Journal on Computing · doi:10.1137/10080703x · Cited by 157
Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Romero, S. V., Visuri, A.-M., Cadavid, A. G., Simen, A., Solano, E., & Hegade, N. N. (2025) · Communications Physics · doi:10.1038/s42005-025-02270-3 · Cited by 18
Metadata
- Authors
- Impagliazzo, R., & Paturi, R.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 2001-03
- Volume
- 62
- Issue
- 2
- Pages
- 367-375
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W1985572324
- Cited by
- 1,002
- References
- 11
- FWCI
- 4.76
- 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
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.