Record
- Authors
- Karp, R. M.
- Year
- 1972
- Title
- Reducibility among combinatorial problems
- Published in
- Complexity of Computer Computations
- Pages
- 85–103
- Type
- Book chapter
- DOI
- 10.1007/978-1-4684-2001-2_9
- Our note
- none yet
- Verification
- unverified: not yet checked against the source
- Id
karp-1972-reducibility-among-combinatorial-problems
Cited on
- Knowledge Graphs read status: not stated
As cited
The pages cite this work in one form.
-
Karp, R. M. (1972). Reducibility among combinatorial problems. In Complexity of Computer Computations, 85–103. doi:10.1007/978-1-4684-2001-2_9.
BibLaTeX
@incollection{karp-1972-reducibility-among-combinatorial-problems,
author = {Karp, R. M.},
title = {{Reducibility among combinatorial problems}},
booktitle = {Complexity of Computer Computations},
date = {1972},
pages = {85--103},
doi = {10.1007/978-1-4684-2001-2_9}
}