Computational Complexity: A Conceptual Perspective

by Oded Goldreich

This book offers a comprehensive perspective to modern topics in complexity theory, which is a central field of the theoretical foundations of computer science. It addresses the looming question of what can be achieved within a limited amount of time with or without other limited natural computational resources. Can be used as an introduction for advanced undergraduate and graduate students as either a textbook or for self-study, or to experts, since it provides expositions of the various sub-areas of complexity theory such as hardness amplification, pseudorandomness and probabilistic proof systems.

Genres: Computer Science, Textbooks, Science, Computers

632 pages, Hardcover

First published April 28, 2008

About the author

Oded Goldreich is a professor of Computer Science at the Faculty of Mathematics and Computer Science of Weizmann Institute of Science, Israel. His research interests lie within the theory of computation and are, specifically, the interplay of randomness and computation, the foundations of cryptography, and computational complexity theory. He won the Knuth Prize in 2017.

Goldreich has contributed to the development of pseudorandomness, zero knowledge proofs, secure function evaluation, property testing, and other areas in cryptography and computational complexity.

Reviews

[Samuel · Rating 5 out of 5]

Wonderful presentation emphasizing intuition and motivation that leads technical details. Much attention has been paid to pedagogical detail.