Computers and intractability a guide to the theory of NP-completeness Michael R. Garey; David S. Johnson
By: Garey, Michael R
Contributor(s): Johnson, David S
Material type: 
TextLanguage: English Series: A series of books in the mathematical sciencesPublisher: New York [u.a] Freeman [ca. 2009]Edition: 27. printDescription: X, 338 S. Ill., graph. DarstISBN: 0716710455; 9780716710455; 0716710447; 9780716710448Subject(s): Komplexitätstheorie | Algorithmentheorie | NP-vollständiges Problem | Computational complexity | Computer algorithms | Computer programmingDDC classification: 519.422 Other classification: 33.06 | 31.11 | 31.80 | 54.10 | 31.80 | QH 500 | ST 130 | ST 134 | ST 230 Online resources: Inhaltsverzeichnis
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Book
|
Library | 519 (Browse shelf) | Checked out | 05/02/2021 | AT-ISTA#002119 |
Total holds: 0
Literaturverz. S. [291] - 325
There are no comments for this item.