Computational Complexity Hardback: A Modern Approach - Hardcover

Arora; Barak

Hardcover

ISBN 10: 0521424267 ISBN 13: 9780521424264

Verlag: Cambridge University Press, 2009

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.

Über diesen Titel

Ü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.

Details zur Ausgabe

• Verlag: Cambridge University Press
• Erscheinungsdatum: 2009
• Sprache: Englisch
• ISBN 10: 0521424267
• ISBN 13: 9780521424264
• Einband: Tapa dura
• Auflage: 1
• Anzahl der Seiten: 594
• Kontakt zum Hersteller: Cambridge University Press; https://www.cambridge.org/; ; Via Honduras,15; Pomezia; Italia; 71; Italien