Computers and intractability : a guide to the theory of NP-completeness / Michael R. Garey, David S. Johnson.
By: Garey, Michael R
.
Contributor(s): Johnson, David S [author.].
Material type: 
TextSeries: Series of books in the mathematical sciences: Publisher: San Francisco : W.H. Freeman, �1979General Notes: Includes indexes.Bibliography: Includes bibliographical references (pages 291-325).Description: x, 338 pages : illustrations ; 24 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 9780716710448; 9780716710455.Other title: NP-completeness.Subject(s): Computer programming | Computer algorithms | Computational complexityDDC classification: 519.4 | Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| Two Weeks | Davenport Library Circulating Collection | Print-Circulating | 519.4 G179 1979 (Browse shelf(Opens below)) | Available | 34284003866316 |
Browsing Davenport Library shelves, Shelving location: Circulating Collection, Collection: Print-Circulating Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 519 M699 Finite mathematics : an applied approach / | 519.1 G532 An elementary introduction to the theory of probability / | 519.2 Sm57 Statistical reasoning / | 519.4 G179 1979 Computers and intractability : a guide to the theory of NP-completeness / | 519.5 B452 Basic business statistics : concepts and applications / | 519.5 C839 A handbook of introductory statistical methods / | 519.5 D718 Basic business statistics for managers / |
Includes indexes.
Includes bibliographical references (pages 291-325).
1. Computers, complexity, and intractability -- 2. The theory of NP-completeness -- 3. Proving NP-completeness results -- 4. Using NP-completeness to analyze problems -- 5. NP-hardness -- 6. Coping with NP-complete problems -- 7. Beyond NP-completeness -- Appendix: A list of NP-complete problems.
"Shows how to recognize NP-complete problems and offers proactical suggestions for dealing with them effectively. The book covers the basic theory of NP-completeness, provides an overview of alternative directions for further research, and contains and extensive list of NP-complete and NP-hard problems, with more than 300 main entries and several times as many results in total. [This book] is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity. It provides not only a valuable source of information for students but also an essential reference work for professionals in computer science"--Back cover.
There are no comments on this title.