Computers and intractability : A Guide to the Theory of NP-Completeness

By:

Garey, Michael

Contributor(s):

Johnson, David [Autor]

Material type: Text

TextPublication details: Nueva York : W.H. Freeman and Company, 1979Edition: 1st edDescription: vii, 338 p. : ilISBN:

9780716710448

Subject(s):

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

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Call number	Status	Date due	Barcode
Libro	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)

Previous								Next
Previous	F.2 ARO Computational complexity : A modern approach	F.2 BAU Complejidad de los algoritmos	F.2 BOV Introduction to the theory of complexity	F.2 GAR Computers and intractability : A Guide to the Theory of NP-Completeness	F.2 GOL Computational complexity : a conceptual perspective	F.2 GOL Computational complexity : a conceptual perspective	F.2 GOO Algorithm design : foundations, analysis, and Internet examples	Next

Click on an image to view it in the image viewer