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: -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.0716710447.G
Stock Image
Computers and intractability: A guide to the theory of NP-completeness (A Series of books in the mathematical sciences)
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Fair. No Jacket. Former library book; Missing dust jacket; Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0716710447I5N11
Stock Image
Computers and intractability: A guide to the theory of NP-completeness (A Series of books in the mathematical sciences)
Seller: GoldBooks, Denver, CO, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. New Copy. Customer Service Guaranteed. Seller Inventory # 16H72_57_0716710447