Computational Complexity Theory (IAS/PARK CITY MATHEMATICS SERIES) - Hardcover

Hardcover

ISBN 10: 082182872X ISBN 13: 9780821828724

Publisher: Amer Mathematical Society, 2004

Synopsis

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.

About this title

Review

This book contains well written accounts of many branches of complexity theory. ... In particular, any CS grad student doing theory, or any math grad student, should be able to read this book. ... This book would be a good way to learn a lot of complexity theory quickly. --Mathematical Reviews

Edition details

• Publisher: Amer Mathematical Society
• Publication date: 2004
• ISBN 10: 082182872X
• ISBN 13: 9780821828724
• Binding: Hardcover
• Language: English
• Number of pages: 389
• Editor: Rudich Steven, Wigderson Avi