Computational Complexity

Discover the intricate world of computational tasks with "Computational Complexity" by Oded Goldreich, published by Cambridge University Press in 2008. This comprehensive hardback edition spans 632 pages and serves as an essential resource for advanced undergraduate and graduate students. Whether used as a textbook or for self-study, it offers a clear and engaging conceptual introduction to the intrinsic complexity of computational tasks.

Goldreich delves into various sub-areas of complexity theory, including hardness amplification, pseudorandomness, and probabilistic proof systems. This book is perfect for those looking to deepen their understanding of mathematical theory in computation. Enhance your knowledge and explore the foundations of computer science with this authoritative guide.