Reducibility among combinatorial problems

Richard M. Karp

misc2001

Citation key: Karp1972
Year: 2001
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Richard M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, Plenum (1972), 85–103, DOI: 10.1007/978-1-4684-2001-2_9.

Catalog connections

Conjectures citing this source

TCS-001 $P$ versus $NP$ Theoretical computer science

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Richard M. Karp
doi: 10.1007/978-1-4684-2001-2_9
note: Richard M. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, Plenum (1972), 85--103, DOI: 10.1007/978-1-4684-2001-2_9.
title: Reducibility among combinatorial problems
year: 2001