Computational Complexity读书介绍
| 类别 | 页数 | 译者 | 网友评分 | 年代 | 出版社 |
|---|---|---|---|---|---|
| 书籍 | 594页 | 9.4 | 2020 | Cambridge University Press |
| 定价 | 出版日期 | 最近访问 | 访问指数 |
|---|---|---|---|
| GBP 45.99 | 2020-02-20 … | 2020-06-07 … | 65 |
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set.
作者简介Sanjeev Arora is a professor in the department of computer science at Princeton University. He has done foundational work on probabilistically checkable proofs andapproximability of NP-hardproblems. He is the founding director of the Center for Computational Intractability, which is funded by the National Science Foundation.
Boaz Barak is an assistant professor in the departmen...
剧情呢，免费看分享剧情、挑选影视作品、精选好书简介分享。