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.wenda123.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，把...

评分☆☆☆☆☆

用户评价

评分☆☆☆☆☆

Anyone who is going to embark on the complexity thing should read this book, more or less. Minor critiques: (i) there are more than 50 typos in the book and (ii) some proofs and ideas are not intuitive enough, as they could have been.

评分☆☆☆☆☆

实在看不懂。

评分☆☆☆☆☆

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

评分☆☆☆☆☆

A very good book to learn computation complexity. One of the most interesting textbook I've ever read. The authors provide many good examples that help students understanding complicated concepts.

评分☆☆☆☆☆

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