Garey, Michael <br/><br/>
Computers and intractability :  A Guide to the Theory of NP-Completeness 

 - 1st ed. 
 - Nueva York :   W.H. Freeman and Company,  1979 
 - vii, 338 p. :  il. 
<br/><br/>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 
<br/><br/><label>ISBN: </label>9780716710448 
<br/><br/><label>Standard No.: </label>DIF-M6020 
<br/><br/><label>Subjects--Topical Terms: </label><br/>COMPLEJIDAD COMPUTACIONAL
<br/><br/><label>Subjects--Index Terms: </label>NP-Completeness