In Used Condition. Seller Inventory # Ubyused0716710447
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.
Title: Computers and intractability: A guide to the...
Publisher: W. H. Freeman
Publication Date: 1979
Binding: Hardcover
Condition: very good
Book Description hardcover. Condition: Very Good. Orders shipped daily from the UK. Professional seller. Seller Inventory # mon0000448096
Book Description Hardcover. Condition: Fair. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 0716710447-7-1
Book Description Condition: Used - Acceptable. 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 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. Seller Inventory # TXT-030524-0025
Book Description Hardcover. Condition: very good. Very Good Copy. Customer Service Guaranteed. Seller Inventory # think_very_0716710447
Book Description Condition: Fair. Buy with confidence! Book is in acceptable condition with wear to the pages, binding, and some marks within 1.15. Seller Inventory # bk0716710447xvz189zvxacp
Book Description Condition: Fair. Acceptable/Fair condition. Book is worn, but the pages are complete, and the text is legible. Has wear to binding and pages, may be ex-library. 1.15. Seller Inventory # 353-0716710447-acp
Book Description Condition: very good. Seller Inventory # UsedCamp0716710447
Book Description Condition: Very Good. Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting. 1.15. Seller Inventory # 0716710447-2-3
Book Description Hardcover. Condition: new. Prompt service guaranteed. Seller Inventory # Clean0716710447
Book Description Hardcover. Condition: new. Buy for Great customer experience. Seller Inventory # GoldenDragon0716710447