Computers and Intractability 在線電子書 圖書標籤: 計算機科學 計算復雜性 計算機 數學 NP CS 算法 TCS
發表於2025-03-16
Computers and Intractability 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2025
經典老書;媽媽再也不用擔心我證不齣NP-hard瞭
評分finally 看懂 reduction from 3DM to 3SAT... 7 hours before the exam...
評分NP不會證明就看看這本吧。但是假如應付考試Algorithm Design那本就足夠瞭。
評分無敵
評分The ultimate guide to NP-completeness
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.
評分
評分
評分
評分
Computers and Intractability 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2025