Computational Complexity A Modern Approach

Arora, Sanjeev

ISBN 10: 0521424267 / ISBN 13: 9780521424264

Edité par Cambridge University Press, 2009

A propos de cet article

Ships SAME or NEXT business day. We Ship to APO/FPO addr. Choose EXPEDITED shipping and receive in 2-5 business days within the United States. See our member profile for customer support contact info. We have an easy return policy.

N° de réf. du vendeur 54827378

Détails bibliographiques

• Titre: Computational Complexity A Modern Approach
• Éditeur: Cambridge University Press
• Date de parution: 2009
• Langue: anglais
• ISBN à 10 chiffres: 0521424267
• ISBN à 13 chiffres: 9780521424264
• Reliure: Couverture rigide
• État de l'article: Brand New

A propos de ce titre

Synopsis

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.

À propos des auteurs

Sanjeev Arora is a Professor in the department of computer science at Princeton University. He holds a Ph.D. from the University of California, Berkeley and has done foundational work in complexity theory, probabilistically checkable proofs, and approximation algorithms.

Boaz Barak is an assistant professor in the department of computer science at Princeton University. He holds a Ph.D. from the Weizmann Institute of Science.