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: New York : W. H. Freeman and company, 2003.Edition: 1a edDescription: 338 p. : íl. ; 23 cmISBN:- 0716710447
- 0716710455
- QA76.6 G37 2003
Item type | Current library | Call number | Copy number | Status | Notes | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Libro | Biblioteca de la Facultad de Físico Matemáticas General | QA76.6 G37 2003 C:1 (Browse shelf(Opens below)) | C:1 | Available | Solo para Lectura | FFM000006644 | ||
Libro | Biblioteca de la Facultad de Físico Matemáticas General | QA76.6 G37 2003 C:2 (Browse shelf(Opens below)) | C:2 | Available | Prestamo | FFM000006716 |
Browsing Biblioteca de la Facultad de Físico Matemáticas shelves, Shelving location: General Close shelf browser (Hides shelf browser)
QA76.6 D65 1986 C:1 Systems progamming / | QA76.6 F35 1987 C:1 Ingenieria de Software | QA76.6 G37 2003 C:1 Computers and intractability : A guide to the theory of np-completeness / | QA76.6 G37 2003 C:2 Computers and intractability : A guide to the theory of np-completeness / | QA76.6 I58 2001 C:1 Introduction to algorithms / | QA76.6 I58 2001 C:2 Introduction to algorithms / | QA76.6 I58 2001 C:3 Introduction to algorithms / |
Incluye referencias e índice
There are no comments on this title.
Log in to your account to post a comment.