1 results
Richard M. Karp. 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 York, edited by Raymond E. Miller and James W. Thatcher, Plenum Press, New York and London 1972, pp. 85–103.
-
- Journal:
- The Journal of Symbolic Logic / Volume 40 / Issue 4 / December 1975
- Published online by Cambridge University Press:
- 12 March 2014, pp. 618-619
- Print publication:
- December 1975
-
- Article
- Export citation