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

☆☆☆☆☆
简体网页||繁体网页

Sanjeev Arora

Cambridge University Press

2009-4-20

594

GBP 45.99

Hardcover

9780521424264

图书标签: 计算复杂性计算理论计算机计算机科学 CS TCS 数学 textbook

喜欢 Computational Complexity 的读者还喜欢

下载链接在页面底部

点击这里下载

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

想要找书就要到小哈图书下载中心

qciss.net

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-12-23

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

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.

Computational Complexity 下载 mobi epub pdf txt 电子书

著者简介

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.

图书目录

Computational Complexity pdf epub mobi txt 电子书下载

想要找书就要到小哈图书下载中心

qciss.net

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

用户评价

评分☆☆☆☆☆

实在看不懂。

评分☆☆☆☆☆

实在看不懂。

评分☆☆☆☆☆

实在看不懂。

评分☆☆☆☆☆

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

评分☆☆☆☆☆

参考书目