Image from Amazon.com
Computers and Intractability: A Guide to the Theory of NP-Completeness/ Michael R. Garey and David S. Johnson.
Material type:
TextLanguage: English Publication details: New York: W. H. Freeman and Company, c.1979Description: x, 338pISBN: - 9780716710455
- 519.4 GAR/C
| Item type | Current library | Collection | Call number | Status | Barcode | |
|---|---|---|---|---|---|---|
Reference
|
Indian Institute of Technology Tirupati Reference | Computer Science | REF 519.4 GarC (Browse shelf(Opens below)) | Not for loan | 08617 |
Browsing Indian Institute of Technology Tirupati shelves, Shelving location: Reference, Collection: Computer Science Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| REF 519.2 SheI (04531) INTRODUCTION TO PROBABILITY MODELS | REF 519.23 PutM Markov Decision Processes : Discrete Stochastic Dynamic Programming / | REF 519.233 KriP Partially Observed Markov Decision Processes : | REF 519.4 GarC Computers and Intractability: A Guide to the Theory of NP-Completeness/ | REF 519.4 PreN2 Numerical Recipes in C++: The Art of Scientific Computing | REF 519.55 PalP Practical Time Series Analysis : | REF 519.6 BoyC Convex Optimzation / |
There are no comments on this title.
Log in to your account to post a comment.