Computational Complexity

A Modern Approach

Nonfiction, Science & Nature, Mathematics, Discrete Mathematics, Computers, General Computing, Reference & Language, Reference
Cover of the book Computational Complexity by Sanjeev Arora, Boaz Barak, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Sanjeev Arora, Boaz Barak ISBN: 9781139234757
Publisher: Cambridge University Press Publication: April 20, 2009
Imprint: Cambridge University Press Language: English
Author: Sanjeev Arora, Boaz Barak
ISBN: 9781139234757
Publisher: Cambridge University Press
Publication: April 20, 2009
Imprint: Cambridge University Press
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book Australian Export by Sanjeev Arora, Boaz Barak
Cover of the book A World without Privacy by Sanjeev Arora, Boaz Barak
Cover of the book Ethics, Medicine, and Information Technology by Sanjeev Arora, Boaz Barak
Cover of the book Challenging Behaviour by Sanjeev Arora, Boaz Barak
Cover of the book Analyzing Linguistic Data by Sanjeev Arora, Boaz Barak
Cover of the book Magnetohydrodynamics of Laboratory and Astrophysical Plasmas by Sanjeev Arora, Boaz Barak
Cover of the book Plato’s Charmides by Sanjeev Arora, Boaz Barak
Cover of the book Time Series Models for Business and Economic Forecasting by Sanjeev Arora, Boaz Barak
Cover of the book The Canonization of Islamic Law by Sanjeev Arora, Boaz Barak
Cover of the book Foreign Affairs and the EU Constitution by Sanjeev Arora, Boaz Barak
Cover of the book Management across Cultures by Sanjeev Arora, Boaz Barak
Cover of the book Cognition and Motivation by Sanjeev Arora, Boaz Barak
Cover of the book Case-Control Studies by Sanjeev Arora, Boaz Barak
Cover of the book The Higher Arithmetic by Sanjeev Arora, Boaz Barak
Cover of the book Physics and Philosophy: Volume 4 by Sanjeev Arora, Boaz Barak
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy