Computational Complexity: A Modern Approach

Note moyenne 4,27
( 62 avis fournis par GoodReads )
 
9780521424264: Computational Complexity: A Modern Approach

Book by Arora Sanjeev Barak Boaz

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Revue de presse :

'This book by two leading theoretical computer scientists provides a comprehensive, insightful and mathematically precise overview of computational complexity theory, ranging from early foundational work to emerging areas such as quantum computation and hardness of approximation. It will serve the needs of a wide audience, ranging from experienced researchers to graduate students and ambitious undergraduates seeking an introduction to the mathematical foundations of computer science. I will keep it at my side as a useful reference for my own teaching and research.' Richard M. Karp, University of California at Berkeley

'This text is a major achievement that brings together all of the important developments in complexity theory. Student and researchers alike will find it to be an immensely useful resource.' Michael Sipser, author of Introduction to the Theory of Computation

'Computational complexity theory is at the core of theoretical computer science research. This book contains essentially all of the (many) exciting developments of the last two decades, with high level intuition and detailed technical proofs. It is a must for everyone interested in this field.' Avi Wigderson, Professor, Institute for Advanced Study, Princeton

Présentation de l'éditeur :

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.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Meilleurs résultats de recherche sur AbeBooks

1.

Boaz Barak; Sanjeev Arora
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Quantité : 5
Vendeur
GreatBookPrices
(Columbia, MD, Etats-Unis)
Evaluation vendeur
[?]

Description du livre État : New. N° de réf. du libraire 6020661-n

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 48,95
Autre devise

Ajouter au panier

Frais de port : EUR 2,45
Vers Etats-Unis
Destinations, frais et délais

2.

Boaz Barak; Sanjeev Arora
Edité par CAMBRIDGE UNIVERSITY PRESS, United Kingdom (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 10
Vendeur
The Book Depository US
(London, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2009. Hardback. État : New. 254 x 183 mm. Language: English . Brand New Book. 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. N° de réf. du libraire AAA9780521424264

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 52,41
Autre devise

Ajouter au panier

Frais de port : Gratuit
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

3.

Boaz Barak; Sanjeev Arora
Edité par CAMBRIDGE UNIVERSITY PRESS, United Kingdom (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 10
Vendeur
The Book Depository
(London, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2009. Hardback. État : New. 254 x 183 mm. Language: English . Brand New Book. 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. N° de réf. du libraire AAA9780521424264

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 52,48
Autre devise

Ajouter au panier

Frais de port : Gratuit
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

4.

Boaz Barak; Sanjeev Arora
Edité par Cambridge University Press (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Quantité : > 20
Vendeur
Books2Anywhere
(Fairford, GLOS, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre Cambridge University Press, 2009. HRD. État : New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. N° de réf. du libraire FM-9780521424264

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 44,40
Autre devise

Ajouter au panier

Frais de port : EUR 10,65
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

5.

Boaz Barak; Sanjeev Arora
Edité par Cambridge University Press 2009-04-20 (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Quantité : 2
Vendeur
Chiron Media
(Wallingford, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre Cambridge University Press 2009-04-20, 2009. État : New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. N° de réf. du libraire NU-GRD-00434871

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 51,68
Autre devise

Ajouter au panier

Frais de port : EUR 3,54
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

6.

Boaz Barak; Sanjeev Arora
Edité par Cambridge University Press (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 1
Vendeur
Book Deals
(Lewiston, NY, Etats-Unis)
Evaluation vendeur
[?]

Description du livre Cambridge University Press, 2009. État : New. Brand New, Unread Copy in Perfect Condition. A+ Customer Service! Summary: Part I. Basic Complexity Classes: 1. The computational model - and why it doesn't matter; 2. NP and NP completeness; 3. Diagonalization; 4. Space complexity; 5. The polynomial hierarchy and alternations; 6. Boolean circuits; 7. Randomized computation; 8. Interactive proofs; 9. Cryptography; 10. Quantum computation; 11. PCP theorem and hardness of approximation: an introduction; Part II. Lower Bounds for Concrete Computational Models: 12. Decision trees; 13. Communication complexity; 14. Circuit lower bounds; 15. Proof complexity; 16. Algebraic computation models; Part III. Advanced Topics: 17. Complexity of counting; 18. Average case complexity: Levin's theory; 19. Hardness amplification and error correcting codes; 20. Derandomization; 21. Pseudorandom constructions: expanders and extractors; 22. Proofs of PCP theorems and the Fourier transform technique; 23. Why are circuit lower bounds so difficult?; Appendix A: mathematical background. N° de réf. du libraire ABE_book_new_0521424267

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 56,41
Autre devise

Ajouter au panier

Frais de port : Gratuit
Vers Etats-Unis
Destinations, frais et délais

7.

Boaz Barak; Sanjeev Arora
Edité par Cambridge University Press 2009-04-20, Cambridge (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 1
Vendeur
Blackwell's
(Oxford, OX, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre Cambridge University Press 2009-04-20, Cambridge, 2009. hardback. État : New. N° de réf. du libraire 9780521424264

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 52,78
Autre devise

Ajouter au panier

Frais de port : EUR 5,32
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

8.

Boaz Barak; Sanjeev Arora
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Quantité : 2
Vendeur
Speedy Hen LLC
(Sunrise, FL, Etats-Unis)
Evaluation vendeur
[?]

Description du livre État : New. Bookseller Inventory # ST0521424267. N° de réf. du libraire ST0521424267

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 58,18
Autre devise

Ajouter au panier

Frais de port : Gratuit
Vers Etats-Unis
Destinations, frais et délais

9.

Boaz Barak; Sanjeev Arora
Edité par Cambridge University Press
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 1
Vendeur
THE SAINT BOOKSTORE
(Southport, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre Cambridge University Press. Hardback. État : new. BRAND NEW, Computational Complexity: A Modern Approach, Sanjeev Arora, Boaz Barak, 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. N° de réf. du libraire B9780521424264

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 52,10
Autre devise

Ajouter au panier

Frais de port : EUR 7,03
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

10.

Boaz Barak; Sanjeev Arora
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 2
Vendeur
Ria Christie Collections
(Uxbridge, Royaume-Uni)
Evaluation vendeur
[?]

Description du livre Hardback. État : New. Not Signed; 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 physic. book. N° de réf. du libraire ria9780521424264_rkm

Plus d'informations sur ce vendeur | Poser une question au libraire

Acheter neuf
EUR 58,29
Autre devise

Ajouter au panier

Frais de port : EUR 3,37
De Royaume-Uni vers Etats-Unis
Destinations, frais et délais

autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre