Computational Complexity pdf epub mobi txt 电子书下载 2025

☆☆☆☆☆

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.

出版者:Cambridge University Press

作者:Sanjeev Arora

出品人:

页数:594

译者:

出版时间:2009-4-20

价格:GBP 45.99

装帧:Hardcover

isbn号码:9780521424264

丛书系列:

图书标签:

计算复杂性
计算理论
计算机
计算机科学
CS
TCS
数学
textbook

下载链接在页面底部

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到小美书屋

book.quotespace.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

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.

具体描述

读后感

评分☆☆☆☆☆

版本：非正式出版版，网上下载的版本，以后有机会就买一本。现在用的是正式版的了，不过以前写的这些评论还是依据网络老版的。好久没看此书了。第九章密码学整体通俗易懂。零知识协议写的真少。最后一个定理，[GGM84]，证明写的不好，主要问题出在 Tn次调用G，把...

评分☆☆☆☆☆

用户评价

评分☆☆☆☆☆

before: for COLT! inactive: summer's gone.

评分☆☆☆☆☆

读了一半。这本书写的真是简洁，有时甚至过于简洁了以至于觉得跳跃太大，刚看的时候一头雾水，但是等理解了之后再回头看又觉得书上的论述真是一针见血，直指本质。本书对初学者不够友好，建议阅读时辅以其它的资料（推荐Luc Trevisan的lecture notes以及Ryan O'Donnell的讲课视频）。

评分☆☆☆☆☆

当然，没读完

评分☆☆☆☆☆

别的不说，chapter 20介绍量子算法的形象和详细程度比Nielsen高到不知道哪里去