Opening book details…
Can I read Computational Complexity Theory (Ias/Park City Mathematics Series) on EtoBox?
Computational Complexity Theory (Ias/Park City Mathematics Series) by Steven Rudich, Avi Wigderson, editors, Steven Rudich and Avi Wigderson, Steven Rudich, Avi Wigderson is a nonfiction available to read on EtoBox.
What is Computational Complexity Theory (Ias/Park City Mathematics Series) about?
Computational Complexity Theory is the study of how much of a given resource is required to perform the computations that interest us the most. Four decades of fruitful research have produced a rich and subtle theory of the relationship between different resource measures and problems. At the core of the theory are some of the most alluring open problems in mathematics. This book presents three weeks of lectures from the IAS/Park City Mathematics Institute Summer School on computational complexity. The first week gives a general introduction to the field, including descriptions of the basic models, techniques, results and open problems. The second week focuses on lower bounds in concrete models. The final week looks at randomness in computation, with discussions of different notions of pseudorandomness, interactive proof systems and zero knowledge, and probabilistically checkable proofs (PCPs). It is recommended for independent study by graduate students or researchers interested in computational complexity. The volume is recommended for independent study and is suitable for graduate students and researchers interested in computational complexity.
Who reads Computational Complexity Theory (Ias/Park City Mathematics Series)?
It is typically read by self-directed learners exploring a subject in depth.
Common subject areas: history, science, philosophy, social sciences.
- Author
- Steven Rudich, Avi Wigderson, editors, Steven Rudich and Avi Wigderson, Steven Rudich, Avi Wigderson
- Publisher
- American Mathematical Society, IAS/Park City Mathematics Institute
- Published
- 2004
- Language
- EN
- ISBN
- 9781470439095
- Category
- nonfiction
- Subjects
- Mathematics, Science, Physics
More by Steven Rudich, Avi Wigderson, editors, Steven Rudich and Avi Wigderson, Steven Rudich, Avi Wigderson
Similar books
- Theory of Computational Complexity (Wiley Series in Discrete Mathematics and Optimization) — Ding-Zhu Du, Ker-I Ko (2014)
- Computational Complexity Theory Juris Hartmanis,editor — Juris Hartmanis; American Mathematical Society Short Course (1988 : Atlanta, Ga); Short Course Computational Complexity Theory (1989)
- Low Dimensional Topology (Ias/Park City Mathematics Series, Vol. 15) (IAS/Park City Mathematics Series, 15) — Tomasz S. Mrowka and Peter S. Ozsvath (2009)
- The Mathematics of Data (IAS/Park City Mathematics) (IAS/PARK CITY Mathematics, 25) — Mahoney, Michael W.; Institute for Advanced Study (Princeton, N.J.); Society for Industrial and Applied Mathematics; Duchi, John; Gilbert, Anna C.; Park City Mathematics Institute (2018)
- Geometric Combinatorics (Ias/Park City Mathematics Series) — Ezra Miller, Ezra Miller, Victor Reiner, Bernd Sturmfels (2007)
- Moduli Spaces of Riemann Surfaces (IAS/Park City Mathematics Series) (IAS/Park City Mathematics, 20) — Benson Farb, Richard Hain, Eduard Looijenga, editors (2013)