| || || || || || || |
IAS/Park City Mathematics Series
2004; 389 pp; hardcover
List Price: US$76
Member Price: US$60.80
Order Code: PCMS/10
A Primer on Pseudorandom Generators - Oded Goldreich
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.
Titles in this series are co-published with the Institute for Advanced Study/Park City Mathematics Institute. Members of the Mathematical Association of America (MAA) and the National Council of Teachers of Mathematics (NCTM) receive a 20% discount from list price.
Graduate students and research mathematicians interested in computational complexity.
Table of Contents
AMS Home |
© Copyright 2012, American Mathematical Society