Computational Complexity A Modern Approach – Sanjeev Arora
General:
Name: Computational Complexity A Modern Approach – Sanjeev Arora
Format: pdf
Size: 4.05 MB
Book:
Title: Computational Complexity
Author: Sanjeev Arora
Language: angielski
Year: 2009
Subjects: Computer Technology, Reference, Nonfiction
Publisher: Cambridge University Press
ISBN: 9780521424264
Total pages: 562
Description:
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. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.
Download from RapidGator
https://rapidgator.net/file/189020c39686e892dd3fc2701adba9ea/9n4t3ygqy53tj6296c0ejm.pdf