The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Relative complexity of checking and evaluating
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
B., T. A. A. (1946) · The Mathematical Gazette · doi:10.1017/s0025557200071461 · Cited by 7,129
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
An introduction to the theory of numbers
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90676-1 · Cited by 3,574
Complexity of Computer Computations
(1972) · Springer eBooks · doi:10.1007/978-1-4684-2001-2 · Cited by 2,781
Formal Languages and Their Relation to Automata
Hopcroft, J. E., & Ullman, J. D. (1969) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,355
On the computational complexity of algorithms
Hartmanis, J., & Stearns, R. E. (1965) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1965-0170805-7 · Cited by 1,006
Formal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
Baker, T., Gill, J., & Solovay, R. (1975) · SIAM Journal on Computing · doi:10.1137/0204037 · Cited by 738
Cited by
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Self-citationThe NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
PP is as Hard as the Polynomial-Time Hierarchy
Toda, S. (1991) · SIAM Journal on Computing · doi:10.1137/0220053 · Cited by 665
NP is as easy as detecting unique solutions
Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90135-0 · Cited by 635
Self-citationSome connections between nonuniform and uniform complexity classes
Karp, R. M., & Lipton, R. J. (1980) · Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80 · doi:10.1145/800141.804678 · Cited by 577
Metadata
- Authors
- Valiant, L. G.
- Venue
- Information Processing Letters
- Publisher
- Elsevier BV
- Published
- 1976-05
- Volume
- 5
- Issue
- 1
- Pages
- 20-23
- ISSN
- 0020-0190 (ISSN-L)
- OpenAlex
- W2044504659
- Cited by
- 277
- References
- 12
- FWCI
- 2.68
- 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: Relative complexity of checking and evaluating. https://app.cochat.ai/papers/10.1016/0020-0190(76)90097-1
- The paper
- Valiant, L. G. (1976). Relative complexity of checking and evaluating. Information Processing Letters. https://doi.org/10.1016/0020-0190(76)90097-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.