Pulse en una miniatura para ir a Google Books.
Cargando... Computational Complexity: A Modern Approach (edición 2009)por Sanjeev Arora, Boaz Barak
Información de la obraComputational Complexity: A Modern Approach por Sanjeev Arora
Ninguno Cargando...
Inscríbete en LibraryThing para averiguar si este libro te gustará. Actualmente no hay Conversaciones sobre este libro. Ninguna reseña sin reseñas | añadir una reseña
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. No se han encontrado descripciones de biblioteca. |
Debates activosNingunoCubiertas populares
Google Books — Cargando... GénerosSistema Decimal Melvil (DDC)511.3Natural sciences and mathematics Mathematics General Principles Mathematical (Symbolic) logicClasificación de la Biblioteca del CongresoValoraciónPromedio:
¿Eres tú?Conviértete en un Autor de LibraryThing. |