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 Bringing the State Back In by Sanjeev Arora, Boaz Barak
Cover of the book Virgil: Aeneid Book XII by Sanjeev Arora, Boaz Barak
Cover of the book Social Phobia by Sanjeev Arora, Boaz Barak
Cover of the book Treatment-Related Stroke by Sanjeev Arora, Boaz Barak
Cover of the book Performance Modeling and Design of Computer Systems by Sanjeev Arora, Boaz Barak
Cover of the book Plato's 'Laws' by Sanjeev Arora, Boaz Barak
Cover of the book Nature and Empire in Ottoman Egypt by Sanjeev Arora, Boaz Barak
Cover of the book Bartolomé de las Casas by Sanjeev Arora, Boaz Barak
Cover of the book The Syntax of Arabic by Sanjeev Arora, Boaz Barak
Cover of the book Facing Barriers by Sanjeev Arora, Boaz Barak
Cover of the book Innovating Organization and Management by Sanjeev Arora, Boaz Barak
Cover of the book Dance to the Tune of Life by Sanjeev Arora, Boaz Barak
Cover of the book Consanguinity in Context by Sanjeev Arora, Boaz Barak
Cover of the book Romance, Diaspora, and Black Atlantic Literature by Sanjeev Arora, Boaz Barak
Cover of the book Handbook of Critical Incidents and Essential Topics in Pediatric Anesthesiology 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