New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Books From California, Simi Valley, CA, USA
Hardcover. Zustand: Very Good. Artikel-Nr. mon0004080446
Anzahl: 6 verfügbar
Anbieter: Better World Books, Mishawaka, IN, USA
Zustand: Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Artikel-Nr. 12924249-75
Anzahl: 1 verfügbar
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. DB-9780521424264
Anzahl: 2 verfügbar
Anbieter: PBShop.store US, Wood Dale, IL, USA
HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Artikel-Nr. DB-9780521424264
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9780521424264_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. pp. xxiv + 579 Illus. Artikel-Nr. 8372034
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. 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 tha. Artikel-Nr. 5918908
Anzahl: 2 verfügbar
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Buch. Zustand: Neu. Neuware -This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.Libri GmbH, Europaallee 1, 36244 Bad Hersfeld Englisch. Artikel-Nr. 9780521424264
Anzahl: 1 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Buch. Zustand: Neu. Computational Complexity | A Modern Approach | Sanjeev Arora (u. a.) | Buch | Gebunden | Englisch | 2009 | Cambridge University Pr. | EAN 9780521424264 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu. Artikel-Nr. 101652002
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