Chapter 11 Reference 14

Reducibility Among Combinatorial Problems

Richard M. Karp

Complexity of Computer Computations. The IBM Research Symposia Series 1972 cs.purdue.edu

Open the original at cs.purdue.edu

As cited in DDIA

Richard M. Karp. "Reducibility Among Combinatorial Problems." Complexity of Computer Computations. The IBM Research Symposia Series. Springer, 1972. doi:10.1007/978-1-4684-2001-2_9

Link check

Status: Link appears to be dead (HTTP 404)
Format: text/html
Last checked: 2026-08-29

Identifiers and archived copies

DOI: 10.1007/978-1-4684-2001-2_9