Von dem Buch Computational Complexity: A Modern Approach (Hardcover) haben wir 3 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Arora, Sanjeev / Barak, Boaz: Computational Complexity: A Modern Approach (Hardcover) (ISBN: 9780521424264) 2009, Cambridge University Pr. Jun 2009, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
88%: Sanjeev Arora, Boaz Barak: Computational Complexity: A Modern Approach (ISBN: 9780511581663) 2009, Cambridge University Press, Erstausgabe, in Englisch, auch als eBook.Nur diese Ausgabe anzeigen…
63%: Sanjeev Arora;Boaz Barak: Computational Complexity (ISBN: 9780511530753) 2007, Cambridge University Press, Cambridge University Press, Cambridge University Press, in Englisch, auch als eBook.Nur diese Ausgabe anzeigen…
Computational Complexity: A Modern Approach (Hardcover)
5 Angebote vergleichen
| Preise | 2011 | 2013 | 2014 | 2015 |
|---|---|---|---|---|
| Schnitt | € 39,70 | € 43,14 | € 45,43 | € 59,02 |
| Nachfrage |
1
Computational Complexity: A Modern Approach (2009)
EN PB NWISBN: 9780521424264 bzw. 0521424267, in Englisch, Cambridge University Press, Taschenbuch, neu.
Lieferung aus: Vereinigte Staaten von Amerika, Versandkostenfrei.
Von Händler/Antiquariat, Book Deals [60506629], Lewiston, NY, U.S.A.
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.
Von Händler/Antiquariat, Book Deals [60506629], Lewiston, NY, U.S.A.
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.
2
Computational Complexity (2009)
EN NWISBN: 9780521424264 bzw. 0521424267, in Englisch, Cambridge University Pr. Jun 2009, neu.
Von Händler/Antiquariat, Rhein-Team Lörrach Ivano Narducci e.K. [57451429], Lörrach, Germany.
Neuware - Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included. 579 pp. Englisch.
Neuware - Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included. 579 pp. Englisch.
3
Computational Complexity
EN NWISBN: 9780521424264 bzw. 0521424267, in Englisch, Cambridge University Pr. neu.
Lieferung aus: Deutschland, Versandkostenfrei.
Buchhandlung Kühn GmbH, [4368407].
Neuware - Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included. Buch.
Buchhandlung Kühn GmbH, [4368407].
Neuware - Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included. Buch.
4
Computational Complexity
EN NWISBN: 9780521424264 bzw. 0521424267, in Englisch, Cambridge University Pr. neu.
Lieferung aus: Deutschland, Versandkostenfrei.
Rheinberg-Buch, [3813847].
Neuware - Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included. Buch.
Rheinberg-Buch, [3813847].
Neuware - Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included. Buch.
5
Computational Complexity
EN NWISBN: 9780521424264 bzw. 0521424267, in Englisch, Cambridge University Pr. neu.
bücher-galerie-ac, [3467807].
Neuware - Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included. Buch.
Neuware - Describes recent achievements and classical results of computational complexity theory, including interactive proofs, PCP, derandomization, and quantum computation. It can be used as a reference, for self-study, or as a beginning graduate textbook. More than 300 exercises are included. Buch.
Lade…