Computers and Intractability 在線電子書 圖書標籤: 計算機科學 計算復雜性 計算機 數學 NP CS 算法 TCS
發表於2024-12-23
Computers and Intractability 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024
就NP-hard的歸約而言,這本書實在是太棒瞭,證明都很elegant。我印象最深的是關於3SAT NP-hard的proof,比Boaz和Sanjeev那本講得好瞭太多,當然,Boaz那本比較適閤真正要做research的人,這本對要做research人來說沒什麼用,都是很早之前的研究成果瞭。
評分坑
評分就NP-hard的歸約而言,這本書實在是太棒瞭,證明都很elegant。我印象最深的是關於3SAT NP-hard的proof,比Boaz和Sanjeev那本講得好瞭太多,當然,Boaz那本比較適閤真正要做research的人,這本對要做research人來說沒什麼用,都是很早之前的研究成果瞭。
評分經典老書;媽媽再也不用擔心我證不齣NP-hard瞭
評分坑
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 下載 2024