The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
On total functions, existence theorems and computational complexity
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
(1973) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(09)x7013-3 · Cited by 2,937
Bimatrix Equilibrium Points and Mathematical Programming
Lemke, C. E. (1965) · Management Science · doi:10.1287/mnsc.11.7.681 · Cited by 1,029
Linear complementarity, linear and nonlinear programming
(1989) · European Journal of Operational Research · doi:10.1016/0377-2217(89)90500-6 · Cited by 978
Complementary pivot theory of mathematical programming
Cottle, R. W., & Dantzig, G. B. (1968) · Linear Algebra and its Applications · doi:10.1016/0024-3795(68)90052-9 · Cited by 767
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
Self-citationNash and correlated equilibria: Some complexity considerations
Gilboa, I., & Zemel, E. (1989) · Games and Economic Behavior · doi:10.1016/0899-8256(89)90006-7 · Cited by 406
Every Prime Has a Succinct Certificate
Pratt, V. R. (1975) · SIAM Journal on Computing · doi:10.1137/0204018 · Cited by 309
Simple Local Search Problems that are Hard to Solve
Schäffer, A. A. (1991) · SIAM Journal on Computing · doi:10.1137/0220004 · Cited by 291
Relative complexity of checking and evaluating
Valiant, L. G. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90097-1 · Cited by 277
The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
Papadimitriou, C. H. (1992) · SIAM Journal on Computing · doi:10.1137/0221030 · Cited by 98
Self-citation
Cited by
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
The Complexity of Computing a Nash Equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2009) · SIAM Journal on Computing · doi:10.1137/070699652 · Cited by 921
Self-citationOn the complexity of the parity argument and other inefficient proofs of existence
Papadimitriou, C. H. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80063-7 · Cited by 778
Self-citationSettling the complexity of computing two-player Nash equilibria
Chen, X., Deng, X., & Teng, S.-H. (2009) · Journal of the ACM · doi:10.1145/1516512.1516516 · Cited by 560
The complexity of computing a Nash equilibrium
Daskalakis, C., Goldberg, P. W., & Papadimitriou, C. H. (2006) · Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing · doi:10.1145/1132516.1132527 · Cited by 470
Self-citation
Metadata
- Authors
- Megiddo, N., & Papadimitriou, C. H.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 1991-04
- Volume
- 81
- Issue
- 2
- Pages
- 317-324
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W1980813953
- Cited by
- 291
- References
- 10
- FWCI
- 0.95
- 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: On total functions, existence theorems and computational complexity. https://app.cochat.ai/papers/10.1016/0304-3975(91)90200-l
- The paper
- Megiddo, N., & Papadimitriou, C. H. (1991). On total functions, existence theorems and computational complexity. Theoretical Computer Science. https://doi.org/10.1016/0304-3975(91)90200-l
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.