Image from Syndetics
Computers and intractability : a guide to the theory of NP-completeness / Michael R. Garey, David S. Johnson.
By: Garey, Michael R [author]
.
Contributor(s): Johnson, David S [joint author.].
Material type: 
BookSeries: Series of books in the mathematical sciences: Publisher: San Francisco : W.H. Freeman, [1979]Copyright date: ©1979Description: x, 338 pages : illustrations ; 24 cm.Content type: text Media type: unmediated Carrier type: volumeISBN: 0716710455 (paperback) .Subject(s): Computer programming | Computer algorithms | Computational complexityDDC classification: 005.1
Contents:
Computers, complexity and interactibility -- The theory of NP completeness -- Proving NP completeness results -- Using NP completeness to analyze problems -- NP hardness -- Coping with NP complete problems -- Beyond NP completeness.
| Item type | Current library | Call number | Copy number | Status | Barcode | |
|---|---|---|---|---|---|---|
| General lending | MTU Bishopstown Library Store | 005.1 (Browse shelf(Opens below)) | Available | 00038502 | ||
| General lending | MTU Bishopstown Library Store | 005.1 (Browse shelf(Opens below)) | 1 | Available | 00126765 | |
| General lending | MTU Bishopstown Library Store | 005.1 (Browse shelf(Opens below)) | 1 | Available | 00030463 |
Total holds: 0
Browsing MTU Bishopstown Library shelves, Shelving location: Store Close shelf browser (Hides shelf browser)
Bibliography: (pages 291-325) and indexes.
Computers, complexity and interactibility -- The theory of NP completeness -- Proving NP completeness results -- Using NP completeness to analyze problems -- NP hardness -- Coping with NP complete problems -- Beyond NP completeness.