𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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.

✍ Scribed by Review by: Ronald V. Book

Book ID
124972227
Publisher
Cambridge University Press (CUP)
Year
1975
Tongue
English
Weight
109 KB
Volume
40
Category
Article
ISSN
0022-4812

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Richard M. Karp. Reducibility among comb
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.
✍ Review by: Ronald V. Book 📂 Article 📅 1975 🏛 Cambridge University Press (CUP) 🌐 English ⚖ 109 KB