Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences) - Softcover
Synopsis
A readable, straightforward guide by two authors with extensive experience in the field. This text shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. It is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity.
"synopsis" may belong to another edition of this title.
Review
This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, "I can't find an efficient algorithm, but neither can all these famous people." This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.
The focus of this book is to teach the reader how to identify, deal with, and understand the essence of NP-complete problems; Computers and Intractability does all of those things effectively. In a readable yet mathematically rigorous manner, the book covers topics such as how to prove that a given problem is NP-complete and how to cope with NP-complete problems. (There is even a chapter on advanced topics, with numerous references.) Computers and Intractability also contains a list of more than 300 problems--most of which are known to be NP-complete--with comments and references.
"About this title" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Computers and Intractability: A Guide to the Theory...
Seller Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: Bay State Book Company, North Smithfield, RI, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing. Seller Inventory # BSM.14R84
Stock Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_453356884
Seller Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: Goodwill Books, Hillsboro, OR, U.S.A.
Seller rating 5 out of 5 stars
Condition: acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. Seller Inventory # GICWV.0716710455.A
Stock Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: Bookmans, Tucson, AZ, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Good. . Satisfaction 100% guaranteed. Seller Inventory # mon0002723309
Stock Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Published by
W. H. Freeman (edition First Edition), 1979
ISBN 10: 0716710455
ISBN 13: 9780716710455
Used
Paperback
First Edition
Seller: BooksRun, Philadelphia, PA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. First Edition. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Seller Inventory # 0716710455-8-1
Stock Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Published by
W. H. Freeman (edition First Edition), 1979
ISBN 10: 0716710455
ISBN 13: 9780716710455
Used
Paperback
First Edition
Seller: BooksRun, Philadelphia, PA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. First Edition. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Seller Inventory # 0716710455-11-1
Seller Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: Greenworld Books, Arlington, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. Fast Free Shipping â" Good condition. It may show normal signs of use, such as light writing, highlighting, or library markings, but all pages are intact and the book is fully readable. A solid, complete copy that's ready to enjoy. Seller Inventory # GWV.0716710455.G
Seller Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: -OnTimeBooks-, Phoenix, AZ, U.S.A.
Seller rating 5 out of 5 stars
Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. Seller Inventory # OTV.0716710455.G
Stock Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Seller rating 5 out of 5 stars
Condition: Very Good. 340 pp., Paperback, previous owner's name to half-title page, wear to spine and covers else text clean & binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB1346625
Stock Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Published by
W. H. Freeman, 1979
ISBN 10: 0716710455
ISBN 13: 9780716710455
Used
paperback
First Edition
Seller: Textbooks_Source, Columbia, MO, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: Good. First Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 000016773U