圖書標籤: 計算復雜性 計算理論 計算機 計算機科學 CS TCS 數學 textbook
发表于2024-11-08
Computational Complexity pdf epub mobi txt 電子書 下載 2024
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 department of computer science at Princeton University. He has done foundational work in computational complexity andcryptography, especially in developing “non-blackbox” techniques.
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.
評分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高到不知道哪裏去
評分彆的不說,chapter 20介紹量子算法的形象和詳細程度比Nielsen高到不知道哪裏去
評分講明白瞭很多我沒理解透的點
版本:非正式出版版,网上下载的版本,以后有机会就买一本。 现在用的是正式版的了,不过以前写的这些评论还是依据网络老版的。好久没看此书了。 第九章 密码学 整体通俗易懂。零知识协议写的真少。 最后一个定理,[GGM84],证明写的不好,主要问题出在 Tn次调用G,把...
評分版本:非正式出版版,网上下载的版本,以后有机会就买一本。 现在用的是正式版的了,不过以前写的这些评论还是依据网络老版的。好久没看此书了。 第九章 密码学 整体通俗易懂。零知识协议写的真少。 最后一个定理,[GGM84],证明写的不好,主要问题出在 Tn次调用G,把...
評分版本:非正式出版版,网上下载的版本,以后有机会就买一本。 现在用的是正式版的了,不过以前写的这些评论还是依据网络老版的。好久没看此书了。 第九章 密码学 整体通俗易懂。零知识协议写的真少。 最后一个定理,[GGM84],证明写的不好,主要问题出在 Tn次调用G,把...
評分有人说数学有多美。有人说复杂度理论有多美。我亲眼见过有人眯着眼睛告诉我,数学是多么的美。 虚伪做作。哗众取宠。道听途说。 他们或者并不知道数学是否美。但他们听过其他人说这个的观点,那些自某些大牛口中流传下来的观点,被廉价的唾液复制上千遍,于是他也要拿来复制...
評分版本:非正式出版版,网上下载的版本,以后有机会就买一本。 现在用的是正式版的了,不过以前写的这些评论还是依据网络老版的。好久没看此书了。 第九章 密码学 整体通俗易懂。零知识协议写的真少。 最后一个定理,[GGM84],证明写的不好,主要问题出在 Tn次调用G,把...
Computational Complexity pdf epub mobi txt 電子書 下載 2024