Reducibility Among Combinatorial Problems", in Complexity of Computer Computations (1972)

by R M Karp