Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 21 of the 22 references it cites were found in a registry or an index.

Optimization, approximation, and complexity classes

Open access
Papadimitriou, Christos H., Yannakakis, Mihalis · 1991 · Journal of Computer and System Sciences

Overview

Integrity signals

Registry

Crossref · 10.1016/0022-0000(91)90023-x

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 22 references

Cited by

See all 1,653

Metadata

Authors
Papadimitriou, C. H., & Yannakakis, M.
Affiliations
  • University of California San Diego (US)
  • AT&T (United States) (US)
Venue
Journal of Computer and System Sciences
Publisher
Elsevier BV
Published
1991-12
Volume
43
Issue
3
Pages
425-440
ISSN
0022-0000 (ISSN-L)
OpenAlex
W2038225707
Cited by
1,653
References
22
Citations by year
2026: 16 · 2025: 27 · 2024: 34 · 2023: 28 · 2022: 42 · 2021: 46 · 2020: 35 · 2019: 42 · 2018: 42 · 2017: 28 · 2016: 41 · 2015: 41 · 2014: 53 · 2013: 71 · 2012: 59
FWCI
33.43
Type
journal article
Language
en
Open access
Licence
Locations
Journal of Computer and System Sciences (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
  • Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
Keywords
optimization problems, approximation algorithms, polynomial-time approximation scheme, complexity classes, NP-completeness

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: Optimization, approximation, and complexity classes. https://app.cochat.ai/papers/10.1016/0022-0000(91)90023-x
The paper
Papadimitriou, C. H., & Yannakakis, M. (1991). Optimization, approximation, and complexity classes. Journal of Computer and System Sciences. https://doi.org/10.1016/0022-0000(91)90023-x

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.