Computers and intractability
Subtitle: a guide to the theory of NP-completeness
By: Michael R. Garey, David S. Johnson.
Contributors: Johnson, David S., 1945-
Series: A Series of books in the mathematical sciences
Publisher: W.H. Freeman
Published: 1983
Place of publication: New York
Language: eng
Number of pages: 340
Subjects: Computer programming.; Algorithms.; Computational complexity.
Other titles: NP-completeness.
Notes: "Update for the current printing:" p. [339]-340 (dated "December, 1983")

Includes indexes.

Bibliography: p. [291]-325.