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.