Advanced
Error loading page.
Try refreshing the page. If that doesn't work, there may be a network issue, and you can use our self test page to see what's preventing the page from loading.
Learn more about possible network issues or contact support for more help.
Title details for Computational Complexity by Sanjeev Arora - Available

Computational Complexity

A Modern Approach

by Sanjeev Arora
Boaz Barak
ebook
1 of 1 copy available
Borrow Read a sample Read a sample
1 of 1 copy available
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.

Formats

  • Kindle Book
  • OverDrive Read
  • EPUB ebook
Kindle restrictions

subjects

Languages

  • English

Loading