The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
Reducibility among Combinatorial Problems
The work
| Authors | Richard M. Karp |
|---|---|
| Editors | |
| Type | incollection |
| Year | 1972 |
| Citekey | karp1972reducibility |
Where it appeared
| Published in | Complexity of Computer Computations |
|---|---|
| Publisher | Springer US |
| Pages | 85--103 |
Identifiers
| DOI | 10.1007/978-1-4684-2001-2_9 |
|---|---|
| OpenAlex | W2401610261 |
| ISBN | 978-1-4684-2003-6 |
Access
| Landing page | https://doi.org/10.1007/978-1-4684-2001-2_9 |
|---|
Empty on purpose
| abstract, copy, volume |
Related
| Distinct from | cook1971complexity |
|---|
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-09-03 05:09 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@incollection{karp1972reducibility,
title = {Reducibility among Combinatorial Problems},
author = {Richard M. Karp},
year = {1972},
booktitle = {Complexity of Computer Computations},
publisher = {Springer US},
pages = {85--103},
isbn = {978-1-4684-2003-6},
doi = {10.1007/978-1-4684-2001-2_9},
}
This record lives at https://refs.drheap.org/karp1972reducibility/ and will keep doing so.