Computational Complexity

Computational Complexity

EnglishEbook
Arora, Sanjeev
Cambridge University Press
EAN: 9780511530753
Available online
CZK 1,693
Common price CZK 1,881
Discount 10%
pc

Detailed information

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.
EAN 9780511530753
ISBN 0511530757
Binding Ebook
Publisher Cambridge University Press
Publication date April 20, 2009
Language English
Country Uruguay
Authors Arora, Sanjeev; Barak, Boaz
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on helpdesk@megabooks.sk, we will be happy to provide it.