Bild 1 von 1
Galerie
Bild 1 von 1
Ähnlichen Artikel verkaufen?
Computational Complexity by Boaz & Sanjeev INTERNATIONAL EDITION
US $37,50
Ca.CHF 30,14
Artikelzustand:
Neu
Neues, ungelesenes, ungebrauchtes Buch in makellosem Zustand ohne fehlende oder beschädigte Seiten. Genauere Einzelheiten entnehmen Sie bitte dem Angebot des Verkäufers.
Letzter Artikel2 verkauft
- Sofort-KaufenComputational Complexity by Boaz & Sanjeev INTERNATIONAL EDITION
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
US $3,99 (ca. CHF 3,21) FedEx International Economy from Abroad.
Standort: LUCKNOW, UTTAR PRADESH, Indien
Lieferung:
Lieferung zwischen Di, 5. Aug und Mi, 6. Aug nach 94104 bei heutigem Zahlungseingang
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
Sicher einkaufen
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:294906131668
Artikelmerkmale
- Artikelzustand
- Features
- International Edition
- PRODUCT TYPE
- INTERNATIONAL EDITION PAPERBACK
- ISBN
- 9780521424264
Über dieses Produkt
Product Identifiers
Publisher
Cambridge University Press
ISBN-10
0521424267
ISBN-13
9780521424264
eBay Product ID (ePID)
71669845
Product Key Features
Number of Pages
594 Pages
Publication Name
Computational Complexity : a Modern Approach
Language
English
Publication Year
2009
Subject
General, Data Processing
Type
Textbook
Subject Area
Computers
Format
Hardcover
Dimensions
Item Height
1.5 in
Item Weight
98.1 Oz
Item Length
10.2 in
Item Width
7.3 in
Additional Product Features
Intended Audience
Scholarly & Professional
LCCN
2009-002789
Dewey Edition
22
Reviews
"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 Professor, University of California at Berkeley, Pre-Publication Review: "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, MIT, author of Introduction to the Theory of Computation, "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, MIT, author of Introduction to the Theory of Computation, '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, MIT, , author of Introduction to the Theory of Computation, Pre-Publication Review: "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, "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, '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, '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, "The reviewer's impressions are that this new textbook on computational complexity is available for a very attractive price and that on Amazon it may be verified that it has received very good reviews by several leaders in this field (Karp, Sipser, Wigderson)." Ulrich Tamm, Mathematical Reviews
Illustrated
Yes
Dewey Decimal
511.3/52
Table Of Content
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.
Synopsis
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., 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., 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.
LC Classification Number
QA267.7 .A76 2009
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
Check-inStore
97% positive Bewertungen•8.0 Tsd. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (814)
- d***a (49)- Bewertung vom Käufer.Letzter MonatBestätigter KaufExcellent!! Love the collection!! Great condition!!
- c***a (67)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGood Quality
- 4***e (1281)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGreat service and product. Thanks for the book
Noch mehr entdecken:
- Internationale Politikbücher,
- Bücher über internationale Politik Sachbuch,
- Bücher über internationales Recht Sachbuch,
- Bücher über internationale Beziehungen Sachbuch,
- Bücher über internationale Küche Sachbuch,
- Hörbücher und Hörspiele Action Europa Editions,
- Bücher über internationale Politik im Taschenbuch Sachbuch,
- Europa-Editions-Erwachsene Hörbücher und Hörspiele,
- Hörbücher und Hörspiele Europa Editions Kassette,
- LP Hörbücher und Hörspiele Europa Editions
Check-inStore
97% positive Bewertungen•8.0 Tsd. Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (814)
- d***a (49)- Bewertung vom Käufer.Letzter MonatBestätigter KaufExcellent!! Love the collection!! Great condition!!
- c***a (67)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGood Quality
- 4***e (1281)- Bewertung vom Käufer.Letzter MonatBestätigter KaufGreat service and product. Thanks for the book