Computational Complexity Hardback: A Modern Approach - Hardcover

Arora; Barak

 
9780521424264: 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.

Über die Autorinnen und Autoren

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.

Weitere beliebte Ausgaben desselben Titels

9781316612156: Computational Complexity A Modern Approach

Vorgestellte Ausgabe

ISBN 10:  1316612155 ISBN 13:  9781316612156
Verlag: SANJEEV ARORA, 2017
Softcover