Computational Complexity: A Modern Approach

Note moyenne 4,26
( 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.

Acheter neuf Afficher le livre
EUR 52,64

Autre devise

Frais de port : Gratuit
De Royaume-Uni vers Etats-Unis

Destinations, frais et délais

Ajouter au panier

Meilleurs résultats de recherche sur AbeBooks

1.

Sanjeev Arora, Boaz Barak
Edité par CAMBRIDGE UNIVERSITY PRESS, United Kingdom (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 1
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 AAU9780521424264

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

Acheter neuf
EUR 52,64
Autre devise

Ajouter au panier

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

2.

Sanjeev Arora, Boaz Barak
Edité par Cambridge University Press 2009-04-20, Cambridge (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 10
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 50,27
Autre devise

Ajouter au panier

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

3.

Sanjeev Arora
Edité par Cambridge University Press 2009-04-20 (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Quantité : 3
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-LBR-00593696

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

Acheter neuf
EUR 53,13
Autre devise

Ajouter au panier

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

4.

Sanjeev Arora, Boaz Barak
Edité par Cambridge University Press
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 2
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 50,02
Autre devise

Ajouter au panier

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

5.

Sanjeev Arora, Boaz Barak
Edité par CAMBRIDGE UNIVERSITY PRESS, United Kingdom (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 1
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 AAU9780521424264

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

Acheter neuf
EUR 57,32
Autre devise

Ajouter au panier

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

6.

Arora, Sanjeev
Edité par Cambridge University Press (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Quantité : > 20
impression à la demande
Vendeur
PBShop
(Wood Dale, IL, Etats-Unis)
Evaluation vendeur
[?]

Description du livre Cambridge University Press, 2009. HRD. État : New. New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. N° de réf. du libraire IP-9780521424264

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

Acheter neuf
EUR 53,94
Autre devise

Ajouter au panier

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

7.

Arora, Sanjeev
Edité par Cambridge University Press (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Quantité : 1
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 BB-9780521424264

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

Acheter neuf
EUR 49,85
Autre devise

Ajouter au panier

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

8.

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

Description du livre Cambridge University Press, 2009. HRD. État : New. New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000. N° de réf. du libraire IP-9780521424264

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

Acheter neuf
EUR 51,04
Autre devise

Ajouter au panier

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

9.

Boaz Barak; Sanjeev Arora
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Quantité : 1
Vendeur
BWB
(Valley Stream, NY, Etats-Unis)
Evaluation vendeur
[?]

Description du livre État : New. Depending on your location, this item may ship from the US or UK. N° de réf. du libraire 97805214242640000000

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

Acheter neuf
EUR 62,81
Autre devise

Ajouter au panier

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

10.

Arora; Barak
Edité par Cambridge University Press (2009)
ISBN 10 : 0521424267 ISBN 13 : 9780521424264
Neuf(s) Couverture rigide Quantité : 1
Vendeur
English-Book-Service Mannheim
(Mannheim, Allemagne)
Evaluation vendeur
[?]

Description du livre Cambridge University Press, 2009. État : New. N° de réf. du libraire L9780521424264

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

Acheter neuf
EUR 60,69
Autre devise

Ajouter au panier

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

autres exemplaires de ce livre sont disponibles

Afficher tous les résultats pour ce livre