Verwandte Artikel zu Computational Complexity Hardback: A Modern Approach
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Críticas
'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
Biografía del autor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagCambridge University Press
- Erscheinungsdatum2009
- ISBN 10 0521424267
- ISBN 13 9780521424264
- EinbandTapa dura
- SpracheEnglisch
- Auflage1
- Anzahl der Seiten594
Neu kaufen
Diesen Artikel anzeigen
EUR 67,92
EUR 8,96 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer
Suchergebnisse für Computational Complexity Hardback: A Modern Approach
Beispielbild für diese ISBN
Computational Complexity
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. DB-9780521424264
Anzahl: 3 verfügbar
Beispielbild für diese ISBN
Computational Complexity: A Modern Approach
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9780521424264_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Computational Complexity
Anbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. 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 tha. Artikel-Nr. 5918908
Anzahl: 3 verfügbar
Foto des Verkäufers
Computational Complexity : A Modern Approach
Verlag:
Cambridge University Pr. Mai 2009, 2009
ISBN 10: 0521424267
ISBN 13: 9780521424264
Neu
Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Neuware - 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. Artikel-Nr. 9780521424264
Anzahl: 1 verfügbar