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.
具体描述
读后感
评分
评分
评分
评分
用户评价
The ultimate guide to NP-completeness
评分就NP-hard的归约而言，这本书实在是太棒了，证明都很elegant。我印象最深的是关于3SAT NP-hard的proof，比Boaz和Sanjeev那本讲得好了太多，当然，Boaz那本比较适合真正要做research的人，这本对要做research人来说没什么用，都是很早之前的研究成果了。
评分The ultimate guide to NP-completeness
评分The ultimate guide to NP-completeness
评分NP不会证明就看看这本吧。但是假如应付考试Algorithm Design那本就足够了。
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.wenda123.org All Rights Reserved. 图书目录大全 版权所有