Computational Complexity: A Conceptual Perspective by Oded Goldreich (2008)

This book provides an extensive outlook on contemporary subjects in complexity theory, a pivotal domain within the theoretical underpinnings of computer science. It explores the fundamental question of what can be accomplished within specific time constraints and with other restricted natural computational resources. [Read More]

A primer on pseudorandom generators by Oded Goldreich (2010)

This introduction to the theory of pseudorandomness offers a fresh perspective on the concept of randomness, rooted in a complexity-theoretic approach. At its core, this approach posits that a distribution is considered random (or pseudorandom) if no efficient procedure can distinguish it from the uniform distribution. [Read More]