Karp Richard M.. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New

External Pages About Karp Richard M.. Reducibility Among Combinatorial Problems. Complexity of Computer Computations, Proceedings of a Symposium on the Complexity of Computer Computations, Held March 20-22, 1972, at the IBM Thomas J. Watson Center, Yorktown Heights, New