Computers and intractability : a guide to the theory of NP-completeness
Material type: TextLanguage: English Series: A Series of books in the mathematical sciencesPublication details: W. H. Freeman, San Francisco, 1979 Description: x, 338pISBN: 9780716710455Subject(s): Computer programming | Computer algorithms | Computational complexityDDC classification: 004.015194 GAR(COM)Item type | Current library | Call number | Materials specified | Copy number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|
Books | Central Library | 004.015194 GAR(COM) (Browse shelf(Opens below)) | 1 | Available | 8550 |
Total holds: 0
Browsing Central Library shelves Close shelf browser (Hides shelf browser)
No cover image available | ||||||||
004.015193 STI(THE) Theory of conditional games | 004.015193 TAD(GAM) Game theory : an introduction | 004.015193 TAY(MAT) The mathematics of games: an introduction to probability | 004.015194 GAR(COM) Computers and intractability : a guide to the theory of NP-completeness | 004.015194 GAR(COM) Computers and intractability : a guide to the theory of NP-completeness | 004.015194 GAR(COM) Computers and intractability : a guide to the theory of NP-completeness | 004.015194 STE(AFT) Afternotes goes to graduate school : lectures on advanced numerical analysis : a series of lectures on advanced numerical analysis presented at the University of Maryland at College Park and recorded after the fact |
SAR/116/2009/19-09-09
There are no comments on this title.