Can I read Computational Complexity : A Modern Approach on EtoBox?

Computational Complexity : A Modern Approach by Sanjeev Arora & Boaz Barak [Arora, Sanjeev & Barak, Boaz] is a mathematics available to read on EtoBox.

What is Computational Complexity : A Modern Approach about?

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.

Who reads Computational Complexity : A Modern Approach?

Author

Sanjeev Arora & Boaz Barak [Arora, Sanjeev & Barak, Boaz]

Publisher

Cambridge University Press (Virtual Publishing)

Published

2016

Language

EN

ISBN

9780511650536

Category

mathematics

Subjects

Philosophy, Literary Criticism, Computer Science

Rating

4.26 / 5 (73 ratings)

Updated

2026-03-14