Math 267AB - Circuit Complexity
U.C. San Diego, Winter-Spring 1992
Student-written scribe notes and homework problems are available in PDF and postscript format.
Shannon and Lupanov theorems. Scribe: Bob Carragher.
Spira and Krapchenko theorems. Scribe: Matt Clegg.
Neciporuk's theorem, simulation of Turing machines by circuits. Scribe: Frank Baeuerle.
AC, NC, CVP, space bounded TM's, Addition in NC1. Scribe: John Lillis.
Parallel Prefix, Symmetric functions. Scribe: Goran Gogic.
Schnorr and Blum lower bounds. Scribe: Dave Robinson.
Subbotovskaya's and Andreev's lower bounds. Scribe: Jinghui Yang.
Hastad's Switching lemma. Scribe: Elias Koutsoupias.
Applications of Hastad's lemma. Scribe: Sam Buss
Constant-depth reducibility (Chandra-Stockmeyer-Vishkin), Smolensky's theorem, part 1. Scribe: Frank Baeuerle.
Smolensky's theorem, part 2, Probabilistic circuits. Valiant-Vazirani theorem, part 1. Scribe: Goran Gogic.
Valiant-Vazirani theorem, part 2, theorems of Toda and Allender-Hertrampf, Scribe: Jinghhui Yang.
Uniformity, unbounded and bounded fanin. Scribe: Dave Robinson.
Uniformity of AC0, linear time hierarchy, multiplication and division (Beame-Cook-Hoover). Scribe: Elias Koutsoupias.
Low-depth circuits for division, continued. Scribe: Sam Buss
Unified list of homework assignment.