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.
具體描述
讀後感
評分
評分
評分
評分
用戶評價
我沒讀完過，讀過前幾章，能證明一些NP，但是還是搞不清楚SAT是怎麼證的
评分無敵
评分就NP-hard的歸約而言，這本書實在是太棒瞭，證明都很elegant。我印象最深的是關於3SAT NP-hard的proof，比Boaz和Sanjeev那本講得好瞭太多，當然，Boaz那本比較適閤真正要做research的人，這本對要做research人來說沒什麼用，都是很早之前的研究成果瞭。
评分就NP-hard的歸約而言，這本書實在是太棒瞭，證明都很elegant。我印象最深的是關於3SAT NP-hard的proof，比Boaz和Sanjeev那本講得好瞭太多，當然，Boaz那本比較適閤真正要做research的人，這本對要做research人來說沒什麼用，都是很早之前的研究成果瞭。
评分無敵
相關圖書
本站所有內容均為互聯網搜索引擎提供的公開搜索信息，本站不存儲任何數據與內容，任何內容與數據均與本站無關，如有需要請聯繫相關搜索引擎包括但不限於百度，google,bing,sogou 等
© 2025 qciss.net All Rights Reserved. 小哈圖書下載中心 版权所有