|
Book Review
The AMS does not provide abstracts of book reviews.
You may download the entire review from the links below.
Retrieve article in:
PDF
Book Information
Author(s):
Michael R. Garey and David S. Johnson
Title:
Computers and intractability: A guide to the theory of $NP$-completeness
Additional book information:
W. H. Freeman and Company, San Francisco, 1979, xii + 338 pp., $10.00 (paper)
References:
- 1.
- A Cobham, The intrinsic computational difficulty of functions, Y. Bar-Hillel (ed.), (Proc. 1964 Internat. Congr.), Logic, Methodology and Philos. Sci., North-Holland, Amsterdam, 1965, pp. 24-30. MR 207561
- 2.
- J. Edmunds, Paths, trees and flowers, Canad. J. Math. 17 (1965), 449-467. MR 177907
- 3.
- S. Cook, The complexity of theorem-proving procedures, Proc. 3rd ACM Sympos. on Theory of Computing, J. Assoc. Comput. Mach. (1971), 151-158.
- 4.
- A. Goldberg, On the complexity of the satisfiability problem, Ph.D. dissertation, Courant Institute of Mathematical Sciences, 1979.
- 5.
- R. Karp, Reducibility among combinatorial problems, R. Miller and J. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103. MR 378476
Additional Information:
Reviewer(s):
Ronald V.
Book
Review Information:
Journal:
Bull. Amer. Math. Soc.
3
(1980),
898-904.
DOI:
10.1090/S0273-0979-1980-14848-X
PII:
S 0273-0979(1980)14848-X
|
