Reducibility among combinatorial problems (1972)

by Richard M Karp
Venue:In Proceedings of a symposium on the Complexity of Computer Computations, The IBM Research Symposia Series