Computers and intractability
Subtitle: a guide to the theory of NP-completeness
By: Michael R. Garey, David S. Johnson.
Contributors: Johnson, David S., 1945- joint author.
Series: A Series of books in the mathematical sciences
Publisher: W. H. Freeman
Published: 1979
Place of publication: San Francisco
Language: eng
Format: paperback
Number of pages: 338
Subjects: Computer programming.; Computer algorithms.; Computational complexity.
Other titles: NP-completeness.
Notes: Bibliography: p. [291]-325.
Includes indexes.
Table of contents: title: Contents
pagenum: v; title: Preface
pagenum: ix; label: 1
title: Computers, Complexity, and Intractability
pagenum: 1; label: 2
title: The Theory of NP-Completeness
pagenum: 17; label: 3
title: Proving NP-Completeness Results
pagenum: 45; label: 4
title: Using NP-Completeness to Analyze Problems
pagenum: 77; label: 5
title: NP-Hardness
pagenum: 109; label: 6
title: Coping with NP-Complete Problems
pagenum: 121; label: 7
title: Beyond NP-Completeness
pagenum: 153; label: A
title: A List of NP-Complete Problems
pagenum: 187; title: Symbol Index
pagenum: 289; title: Reference and Author Index
pagenum: 291; title: Subject Index
pagenum: 327; title: Update for the Current Printing
pagenum: 339