Computational Complexity

Sanjeev Arora

ISBN 10: 0521424267 / ISBN 13: 9780521424264

Verlag: Cambridge University Pr. Mai 2009, 2009

Beschreibung

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.Libri GmbH, Europaallee 1, 36244 Bad Hersfeld 579 pp. Englisch.

Bestandsnummer des Verkäufers 9780521424264

Bibliografische Details

• Titel: Computational Complexity
• Verlag: Cambridge University Pr. Mai 2009
• Erscheinungsjahr: 2009
• Sprache: Englisch
• ISBN-10: 0521424267
• ISBN-13: 9780521424264
• Einband: Buch
• Zustand: Neu

Über diesen Titel

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