Computers and intractability : A Guide to the Theory of NP-Completeness
Material type:
- 9780716710448
Contents:
1. Computers, Complexity, and Intractability -- 2. The Theory of NP-Completeness -- 3. Proving NP-Completeness Results -- 4. Using NP-Completeness to Analyze Problems -- 5. NP-Hardness -- 6. Coping with NP-Complete Problems -- 7. Beyond NP- Completenes -- Appendix: A list of NP-Complete Problems
Item type | Home library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
![]() |
Biblioteca de la Facultad de Informática | F.2 GAR (Browse shelf(Opens below)) | Available | DIF-04027 |
Browsing Biblioteca de la Facultad de Informática shelves Close shelf browser (Hides shelf browser)
1. Computers, Complexity, and Intractability -- 2. The Theory of NP-Completeness -- 3. Proving NP-Completeness Results -- 4. Using NP-Completeness to Analyze Problems -- 5. NP-Hardness -- 6. Coping with NP-Complete Problems -- 7. Beyond NP- Completenes -- Appendix: A list of NP-Complete Problems