Auf ein Miniaturbild klicken, um zu Google Books zu gelangen.
Lädt ... Computational Complexity: A Modern Approach (2009. Auflage)von Sanjeev Arora, Boaz Barak
Werk-InformationenComputational Complexity: A Modern Approach von Sanjeev Arora
Keine Lädt ...
Melde dich bei LibraryThing an um herauszufinden, ob du dieses Buch mögen würdest. Keine aktuelle Diskussion zu diesem Buch. Keine Rezensionen keine Rezensionen | Rezension hinzufügen
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. Keine Bibliotheksbeschreibungen gefunden. |
Aktuelle DiskussionenKeineBeliebte Umschlagbilder
Google Books — Lädt ... GenresMelvil Decimal System (DDC)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicKlassifikation der Library of Congress [LCC] (USA)BewertungDurchschnitt:
Bist das du?Werde ein LibraryThing-Autor. |