Compute and Intractability : a guide to the theory of NP-completness Garey, Michael R. and Johnson, David S.
Material type:
TextLanguage: English Publication details: W.H. Freeman 1979DDC classification: - 511.352 N79 GAR.J
| Item type | Current library | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Books
|
Nalanda Library Circulation Books | 511.352 N79 GAR.J (Browse shelf(Opens below)) | Available | 6000 |
Total holds: 0
Browsing Nalanda Library shelves, Shelving location: Circulation Books Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | No cover image available | ||
| 511.35 T10 GOD Introducing the theory of computation | 511.35 T10 KOH.J Switching and finite automata theory | 511.35 T10 KOH.J Switching and finite automata theory | 511.352 N79 GAR.J Compute and Intractability : a guide to the theory of NP-completness | 511.352 T09 ARO.B Computational complexity a modern approach | 511.352 T09 ARO.B Computational complexity a modern approach | 511.352 T11 MOO.M Nature of computation |
There are no comments on this title.