This book is rooted in the thesis that complexity theory is extremely rich in conceptual
content, and that this contents should be explicitly communicated in expositions and courses …

This beginning graduate textbook describes both recent achievements and classical results
of computational complexity theory. Requiring essentially no background apart from …

This is a survey of pseudorandomness, the theory of efficiently generating objects that" look
random" despite being constructed using little or no randomness. This theory has …

We survey the average-case complexity of problems in NP. We discuss various notions of
good-on-average algorithms, and present completeness results due to Impagliazzo and …

We show that if an NP-complete problem has a nonadaptive self-corrector with respect to
any samplable distribution, then coNP is contained in NP/poly and the polynomial hierarchy …

Abstract Based on Hastad's (1986) circuit lower bounds, Linial, Mansour, and Nisan (1993)
gave a quasipolytime learning algorithm for AC^ 0 (constant-depth circuits with AND, OR …

This is a survey of unconditional pseudorandom generators (PRGs). A PRG uses a short,
truly random seed to generate a long," pseudorandom" sequence of bits. To be more …

We present an iterative approach to constructing pseudorandom generators, based on the
repeated application of mild pseudorandom restrictions. We use this template to construct …

Hardness amplification is the fundamental task of converting a δ-hard function f:(0, 1) n->(0,
1) into a (1/2-ε)-hard function Amp (f), where f is γ-hard if small circuits fail to compute f on at …

We present an explicit pseudorandom generator for oblivious, read-once, permutation
branching programs of constant width that can read their input bits in any order. The seed …