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.
Search results for Computers and Intractability: A Guide to the Theory...
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_441174017
Quantity: 1 available
Seller Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: Upward Bound Books, VALRICO, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: acceptable. This item is worn. Signs of wear may include aesthetic issues such as scratches, dents and worn corners. All pages and the cover are intact, but the dust cover may be missing. Pages may include moderate to heavy number of notes and highlighting, but the text is not obscured or unreadable. Seller Inventory # 59WS4H001EMJ_ns
Quantity: 1 available
Stock Image
Computers and intractability: A guide to the theory of NP-completeness (A Series of books in the mathematical sciences)
Seller: clickgoodwillbooks, Indianapolis, IN, U.S.A.
Seller rating 5 out of 5 stars
Condition: Acceptable. This is a paper back book: Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may be missing bundled media. Seller Inventory # 3O6XBG000BU8_ns
Quantity: 1 available
Stock Image
Computers and Intractability A Guide to the Theory of NP-Completeness
Published by
W. H. Freeman & Company, 1979
ISBN 10: 0716710455
ISBN 13: 9780716710455
Used
Softcover
Seller: TextbookRush, Grandview Heights, OH, U.S.A.
Seller rating 4 out of 5 stars
Condition: Good. Ships SAME or NEXT business day. We Ship to APO/FPO addr. Choose EXPEDITED shipping and receive in 2-5 business days within the United States. See our member profile for customer support contact info. We have an easy return policy. Seller Inventory # 52047916
Quantity: 1 available
Stock Image
Computers and Intractability: A Guide to the Theory of NP-Completeness
Published by
W.H. Freeman & Company January 1979, 1979
ISBN 10: 0716710455
ISBN 13: 9780716710455
Used
Trade Paperback
Seller: Pella Books, Pella, IA, U.S.A.
Seller rating 2 out of 5 stars
Trade Paperback. Condition: Used Good. Very occasional penciling, still tight and square, intact and legible. Seller Inventory # 242458
Quantity: 1 available
Stock Image
Computers and Intractability: A Guide to the Theory of NP-completeness (A series of books in the mathematical sciences)
Seller: AwesomeBooks, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Computers and Intractability: A Guide to the Theory of NP-completeness (A series of books in the mathematical sciences) This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. . Seller Inventory # 7719-9780716710455
Quantity: 1 available
Stock Image
Computers and Intractability: A Guide to the Theory of NP-completeness (A series of books in the mathematical sciences)
Published by
W.H.Freeman & Co Ltd 01/04/1979, 1979
ISBN 10: 0716710455
ISBN 13: 9780716710455
Used
Hardcover
Seller: Bahamut Media, Reading, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Shipped within 24 hours from our UK warehouse. Clean, undamaged book with no damage to pages and minimal wear to the cover. Spine still tight, in very good condition. Remember if you are not happy, you are covered by our 100% money back guarantee. Seller Inventory # 6545-9780716710455
Quantity: 1 available
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
Quantity: Over 20 available
Stock Image
Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences)
Seller: Cotswolds Rare Books, OXFORDSHIRE, United Kingdom
Seller rating 5 out of 5 stars
Soft cover. Condition: Near Fine. In great condition. Seller Inventory # 2681m
Quantity: 1 available
Stock Image
Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
Seller: Title Wave Books, Albuquerque, NM, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. Ships within 24 hours!Paperback, clean pages and tight binding, minor shelf wear and edgewear. Seller Inventory # 210319027
Quantity: 1 available