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.
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.
Anbieter: ThriftBooks-Atlanta, AUSTELL, GA, USA
Hardcover. Zustand: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Artikel-Nr. G0521424267I5N00
Anzahl: 1 verfügbar
Anbieter: Wonder Book, Frederick, MD, USA
Zustand: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects. Artikel-Nr. V12B-04487
Anzahl: 1 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 1st edition. 579 pages. 10.00x7.00x1.25 inches. In Stock. Artikel-Nr. x-0521424267
Anzahl: 2 verfügbar