Local cover image
Local cover image

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

By: Contributor(s): Material type: TextTextPublication 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
Star ratings
    Average rating: 0.0 (0 votes)

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

Click on an image to view it in the image viewer

Local cover image