Image from Amazon.com
Computers and intractability : a guide to the theory of NP-completeness / Michael R. Garey, David S. Johnson.
Material type:
TextSeries: A Series of books in the mathematical sciencesPublication details: San Francisco : W. H. Freeman, c1979.Description: x, 338 p. : ill. ; 24 cmISBN: - 0716710447.
- 0716710455
- 519.4
- QA76.6 .G35
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Books
|
Raman Research Institute Library | 681.32.062 GAR (Browse shelf(Opens below)) | Available | 14552 |
Browsing Raman Research Institute Library shelves Close shelf browser (Hides shelf browser)
|
|
No cover image available |
|
No cover image available |
|
|
||
| 681.32.062 FEY Feynman lectures on computation. | 681.32.062 FEY Feynman lectures on computation / | 681.32.062 GAL Logic for computer science: Foundations of automatic theorem proving | 681.32.062 GAR Computers and intractability : | 681.32.062 GIN Introduction to mathematical machine theory | 681.32.062 GOO "Algorithm design: Foundations, analysis and internet examples" | 681.32.062 GRE Error-free computation : |
Includes indexes.
Bibliography: p. [291]-325.
There are no comments on this title.
Log in to your account to post a comment.