计算复杂性的现代方法读书介绍

Complexity,计算复杂性,数学,计算机科学,Computational,计算理论,计算物理学,计算机,

阿罗拉(S. Arora)      ISBN:9787510042867    原作名/别名:《》

计算复杂性的现代方法摘要

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.

未发行或暂未收录

合作的复杂性 博弈论,社会学,经济学,心理学,合作,行为分析,复杂,博弈,　2020-02-20 …

计算复杂性的现代方法 Complexity,计算复杂性,数学,计算机科学,Computational,计算理论,计算物理学,计算机,　2020-02-20 …

复杂性思维：物质、精神和人类的计算动力学 复杂系统,系统论,思维,科普,哲学,科学哲学,科学,科学人文,　2020-02-20 …

建筑的复杂性与矛盾性 建筑理论,建筑,建筑学,　2020-02-20 …

计算复杂性 计算机科学,复杂性,计算复杂性,computation,计算理论,计算机,数理逻辑,计算,　2020-02-20 …

计算复杂性 计算复杂性,计算机,数学,计算理论,NP,complexity,计算机技术,复杂,　2020-02-20 …

可计算性与数理逻辑 数学,逻辑学,逻辑,人工智能,计算理论,计算机,数理逻辑,计算机科学,　2020-02-20 …

计算复杂性 计算机科学,复杂性,计算机,算法,复杂系统,人工智能,计算理论,阳志平,　2020-02-20 …

可计算性与数理逻辑 数理逻辑,数学,计算机科学,计算机,逻辑,逻辑学,哲学,计算,　2020-02-20 …

建筑的复杂性与矛盾性 建筑,建筑理论,经典,美国,乡土建筑,建筑设计,　2020-02-20 …

计算复杂性的现代方法大结局

剧情呢，免费看分享剧情、挑选影视作品、精选好书简介分享。