Check nearby libraries
Buy this book
This edition doesn't have a description yet. Can you add one?
Check nearby libraries
Buy this book
Previews available in: English
Showing 2 featured editions. View all 2 editions?
Edition | Availability |
---|---|
1
Computers and intractability: a guide to the theory of NP-completeness
1983, W.H. Freeman
in English
0716710455 9780716710455
|
cccc
Libraries near you:
WorldCat
|
2
Computers and intractability: a guide to the theory of NP-completeness
1979, W. H. Freeman
paperback
in English
0716710447 9780716710448
|
aaaa
Libraries near you:
WorldCat
|
Book Details
Table of Contents
Contents
Preface
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-Completeness
A. A List of NP-Complete Problems
Symbol Index
Reference and Author Index
Subject Index
Update for the Current Printing
Edition Notes
Bibliography: p. [291]-325.
Includes indexes.
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created April 1, 2008
- 9 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
December 19, 2023 | Edited by ImportBot | import existing book |
May 25, 2022 | Edited by ImportBot | import existing book |
February 7, 2017 | Edited by r. clayton | fix toc |
February 7, 2017 | Edited by r. clayton | added toc |
April 1, 2008 | Created by an anonymous user | Imported from Scriblio MARC record |