The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Many hard examples for resolution
Open accessAbstract
For every choice of positive integers c and k such that k ≥ 3 and c 2 - k ≥ 0.7, there is a positive number ε such that, with probability tending to 1 as n tends to ∞, a randomly chosen family of cn clauses of size k over n variables is unsatisfiable, but every resolution proof of its unsatisfiability must generate at least (1 + ε) n clauses.
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
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
A Machine-Oriented Logic Based on the Resolution Principle
Robinson, J. A. (1965) · Journal of the ACM · doi:10.1145/321250.321253 · Cited by 3,909
A Computing Procedure for Quantification Theory
Davis, M., & Putnam, H. (1960) · Journal of the ACM · doi:10.1145/321033.321034 · Cited by 2,647
Hall, P. (1935) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-10.37.26 · Cited by 1,954
Linear Inequalities and Related Systems.
Dantzig, G. B., Kuhn, H. W., & Tucker, A. W. (1956) · Medical Entomology and Zoology · Cited by 1,003
Boolean Methods in Operations Research and Related Areas
Hammer, P. L., & Rudeanu, S. (1968) · Ökonometrie und Unternehmensforschung / Econometrics and Operations Research · doi:10.1007/978-3-642-85823-9 · Cited by 529
Bibel, W. (1987) · Vieweg+Teubner eBooks · doi:10.1007/978-3-322-90102-6 · Cited by 463
On the complexity of regular resolution and the Davis-Putnam procedure
Galil, Z. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90054-8 · Cited by 97
Cited by
Handbook of Knowledge Representation
(2008) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(07)x0300-6 · Cited by 883
Relations between average case complexity and approximation complexity
Feige, U. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509985 · Cited by 351
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
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
Metadata
- Authors
- Chvátal, V., & Szemerédi, E.
- Venue
- Journal of the ACM
- Published
- 1988-10
- Volume
- 35
- Issue
- 4
- Pages
- 759-768
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2126420408
- Cited by
- 439
- References
- 8
- FWCI
- 4.92
- 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.