计算复杂性读书介绍
类别 | 页数 | 译者 | 网友评分 | 年代 | 出版社 |
---|---|---|---|---|---|
书籍 | None页 | 2020 | 机械工业出版社 |
定价 | 出版日期 | 最近访问 | 访问指数 |
---|---|---|---|
129元 | 2020-02-20 … | 2021-07-16 … | 53 |
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...
作者简介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 department of computer science at Princeton University. He has done foundational work in computational complexity andcryptography, especially in developing “non-blackbox” techniques.
剧情呢,免费看分享剧情、挑选影视作品、精选好书简介分享。