The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
On the Computational Complexity of Combinatorial Problems
Abstract
A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the sense that either all or none of them can be solved in polynomial time. Moreover, they are solvable in polynomial time if and only if every problem solvable by a polynomial‐depth backtrack search is also solvable by a polynomial‐time algorithm. The technique of deriving these results through problem transformations is explained, and some comments are made as to the probable effect of these results on research in the field of combinatorial algorithms.
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
Self-citationThe 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 $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Self-citationLogic, Methodology and Philosophy of Science.
Black, M., Nagel, E., Suppes, P., & Tarski, A. (1963) · The Philosophical Review · doi:10.2307/2183047 · Cited by 1,949
Edmonds, J. (2009) · Classic Papers in Combinatorics · doi:10.1007/978-0-8176-4842-8_26 · Cited by 1,517
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
Formal Languages and their Relation to Automata
Morris, J. B. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19706 · Cited by 998
Ford, L. R., & Fulkerson, D. R. (1963) · Princeton University Press eBooks · doi:10.1515/9781400875184 · Cited by 891
Generalized first-order spectra and polynomial-time recognizable sets
Fagin, R. (1974) · Medical Entomology and Zoology · Cited by 828
HOW GOOD IS THE SIMPLEX ALGORITHM
Klee, V. L., & Minty, G. J. (1970) · Cited by 769
Some simplified NP-complete problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1974) · Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74 · doi:10.1145/800119.803884 · Cited by 614
Probabilistic Methods in Combinatorics
Spencer, J. (1995) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-9078-6_132 · Cited by 588
Berge, C. (1957) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.43.9.842 · Cited by 567
Complexity Results for Multiprocessor Scheduling under Resource Constraints
Garey, M. R., & Johnson, D. S. (1975) · SIAM Journal on Computing · doi:10.1137/0204035 · Cited by 493
Cook, S. A. (1970) · The Journal of Symbolic Logic · doi:10.2307/2270886 · Cited by 383
Floyd, R. W. (1967) · Journal of the ACM · doi:10.1145/321420.321422 · Cited by 368
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Cook, S. A. (1971) · Journal of the ACM · doi:10.1145/321623.321625 · Cited by 360
Worst-case analysis of memory allocation algorithms
Garey, M. R., Graham, R. L., & Ullman, J. D. (1972) · Proceedings of the fourth annual ACM symposium on Theory of computing - STOC '72 · doi:10.1145/800152.804907 · Cited by 178
Cutland, N. J. (1980) · Cambridge University Press eBooks · doi:10.1017/cbo9781139171496.014 · Cited by 131
Polynomial complete scheduling problems
Ullman, J. D. (1973) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/800009.808055 · Cited by 90
Heuristic Programming as an Aid to Network Design
Lin, S. (1975) · Networks · doi:10.1002/net.1975.5.1.33 · Cited by 56
Cited by
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. R. (1979) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70356-x · Cited by 5,854
Complexity of Machine Scheduling Problems
Lenstra, J. K., Rinnooy Kan, A. H. G., & Brucker, P. (1977) · Annals of Discrete Mathematics · doi:10.1016/s0167-5060(08)70743-x · Cited by 2,197
Graph minors. II. Algorithmic aspects of tree-width
Robertson, N., & Seymour, P. D. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90023-4 · Cited by 1,542
On the inherent intractability of certain coding problems (Corresp.)
Berlekamp, E., McEliece, R., & van Tilborg, H. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055873 · Cited by 1,523
Scheduling subject to resource constraints: classification and complexity
Blazewicz, J., Lenstra, J. K., & Kan, A. H. G. R. (1983) · Discrete Applied Mathematics · doi:10.1016/0166-218x(83)90012-4 · Cited by 1,436
Metadata
- Authors
- Karp, R. M.
- Venue
- Networks
- Publisher
- Wiley
- Published
- 1975-01
- Volume
- 5
- Issue
- 1
- Pages
- 45-68
- ISSN
- 0028-3045 (ISSN-L)
- 1097-0037
- OpenAlex
- W100926944
- Cited by
- 711
- References
- 21
- FWCI
- 22.71
- 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
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.