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

Name: 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
Author: Raymond E. Miller and James W. Thatcher

by Raymond E. Miller and James W. Thatcher · 1 review · 1975

Reviewed by	Journal	Date	Access
Ronald V. Book	The Journal of Symbolic Logic	1975	Restricted

Metaphysics & Logic

Also by Thatcher

Heirs to Dionysus: A Nietzschean Current in Literary Modernism (1 review)
The Ontology of Paul Tillich (1 review)
Why John Wrote a Gospel: Jesus-Memory-History (1 review)

Search PhilReviews for this title