Computational Complexity读书介绍
| 类别 | 页数 | 译者 | 网友评分 | 年代 | 出版社 |
|---|---|---|---|---|---|
| 书籍 | 500页 | 2020 | Addison-Wesley |
| 定价 | 出版日期 | 最近访问 | 访问指数 |
|---|---|---|---|
| GBP 105.99 | 2020-02-20 … | 2020-06-07 … | 92 |
This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, an...
作者简介This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.
剧情呢，免费看分享剧情、挑选影视作品、精选好书简介分享。