Computers and intractability: A guide to the theory of NP-completeness (A Series of books in the mathematical sciences) - Hardcover
Synopsis
Libro usado en buenas condiciones, por su antiguedad podria contener señales normales de uso
"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 (A 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: acceptable. The book is complete and readable, with all pages and cover intact. Dust jacket, shrink wrap, or boxed set case may be missing. Pages may have light notes, highlighting, or minor water exposure, but nothing that affects readability. May be an ex-library copy and could include library markings or stickers. Seller Inventory # BSM.VKR7
Seller Image
Computers and intractability: A guide to the theory of NP-completeness (A 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: acceptable. The book is complete and readable, with all pages and cover intact. Dust jacket, shrink wrap, or boxed set case may be missing. Pages may have light notes, highlighting, or minor water exposure, but nothing that affects readability. May be an ex-library copy and could include library markings or stickers. Seller Inventory # BSM.VBS8
Seller Image
Computers and intractability: A guide to the theory of NP-completeness (A 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: acceptable. The book is complete and readable, with all pages and cover intact. Dust jacket, shrink wrap, or boxed set case may be missing. Pages may have light notes, highlighting, or minor water exposure, but nothing that affects readability. May be an ex-library copy and could include library markings or stickers. Seller Inventory # BSM.U7PW
Stock Image
Computers and intractability: A guide to the theory of NP-completeness (A Series of books in the mathematical sciences)
Seller: Toscana Books, AUSTIN, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Seller Inventory # Scanned0716710447