4. DNF formulas and small-depth circuits
DNF and CNF complexity, tribes and KKL, random restrictions, Håstad's Switching Lemma and the spectrum of DNFs, and the Linial–Mansour–Nisan theorem for constant-depth circuits.
DNF and CNF complexity, tribes and KKL, random restrictions, Håstad's Switching Lemma and the spectrum of DNFs, and the Linial–Mansour–Nisan theorem for constant-depth circuits.