Computational Complexity Hardback: A Modern Approach

4,22 durchschnittliche Bewertung
( 68 Bewertungen bei Goodreads )
 
9780521424264: Computational Complexity Hardback: A Modern Approach

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.

Neu kaufen Angebot ansehen

Versand: EUR 29,50
Von Deutschland nach USA

Versandziele, Kosten & Dauer

In den Warenkorb

Beste Suchergebnisse beim ZVAB

1.

Sanjeev Arora
Verlag: Cambridge University Pr. Jun 2009 (2009)
ISBN 10: 0521424267 ISBN 13: 9780521424264
Neu Anzahl: 1
Anbieter
AHA-BUCH GmbH
(Einbeck, Deutschland)
Bewertung
[?]

Buchbeschreibung Cambridge University Pr. Jun 2009, 2009. Buch. Buchzustand: Neu. 265x184x40 mm. 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. Artikel-Nr. 9780521424264

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 56,99
Währung umrechnen

In den Warenkorb

Versand: EUR 29,50
Von Deutschland nach USA
Versandziele, Kosten & Dauer