Computers and Intractability

书名：Computers and IntractabilityAGuidetotheTheoryofNP-completeness
作者：MRGarey/DSJohnson
译者：
ISBN：9780716710455
出版社：W.H.Freeman
出版时间：1979-4-26
格式：epub/mobi/azw3/pdf
页数：338
豆瓣评分： 9.6

书籍简介：

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.

作者简介：

书友短评：

@ heisen NP不会证明就看看这本吧。但是假如应付考试Algorithm Design那本就足够了。 @ [已注销] 经典老书；妈妈再也不用担心我证不出NP-hard了 @ Marine 我没读完过，读过前几章，能证明一些NP，但是还是搞不清楚SAT是怎么证的 @ ihatetopology The bible of NP-Completeness @ 呱呱 之前学长推荐看的，说几天就看完。我磨磨蹭蹭断断续续看了两三年。书有些年头，从现在的角度看gadget过于复杂有点过时。三四章讲计算问题研究整体思路还不错。附录里的问题很全面，一般当作字典用，常驻我的bib @ ihatetopology The bible of NP-Completeness @ heisen NP不会证明就看看这本吧。但是假如应付考试Algorithm Design那本就足够了。

添加微信公众号:好书天下获取