Reducibility Among Combinatorial Problems
Conference Paper
Domain Context
Computation and Complexity
Citation
Richard M. Karp. (1972). Reducibility Among Combinatorial Problems. Complexity of Computer Computations. pp. 85–103. Springer.
Why this reference is included
Karp’s Reducibility Among Combinatorial Problems (1972) is part of the program’s reference corpus as standard domain context for Computation and Complexity. It is not directly cited in the currently published volumes of Panta Rhei, but is retained as part of the research shelf.
Corpus status
In the corpus only This reference is part of the research corpus but is not directly cited in the currently published volumes of Panta Rhei.