
Lecture 6 of 60 · Circuit Complexity Theory
Raghunath Tewari
Circuit Complexity Theory · 60 lectures
60 lectures
1: Introduction I
2: Introduction II
3: Lower bound for circuits
4: Lower bound for formulas
5: Khrapchenko’s theorem
6: Proof of Khrapchenko’s Theorem
7: Applications of Khrapchenko’s Theorem
8: Nechiporuk’s Theorem
9: Applications of Nechiporuk’s Theorem
10: Subbotovskaya’s Theorem I
11: Subbotovskaya’s Theorem II
12: Applications of Subbotovskaya’s Theorem
13: Upper and Lower Bounds on the Andreev Function
14: Polynomial Size Monotone Formula for MAJORITY (Valiant’s
15: Polynomial Size Monotone Formula for MAJORITY (Valiant’s
16: Circuits for Addition Ripple Adder and Carry Lookahead Adder
17: Circuits for Addition Parallel Prefix Sum Method
18: Circuits for Iterated Addition and Multiplication
19: Bounded Depth Circuit Classes
20: Basic Circuit for Division using NewtonRaphson Method
21: Division in NC1 (Beame, Cook, Hoover Theorem) I
22: Division in NC1 (Beame, Cook, Hoover Theorem) II
23: Division in NC1 (Beame, Cook, Hoover Theorem) III
24: Division in NC1 (Beame, Cook, Hoover Theorem) IV
25: Division in NC1 (Beame, Cook, Hoover Theorem) V
26: Division in NC1 (Beame, Cook, Hoover Theorem) VI
27: Relation between Bounded Depth Circuit Classes and Uniform
28: Relation between Bounded Depth Circuit Classes and Uniform
29: Reducing Circuit Depth
30: P is in P/poly
31: Discussion on Circuit Lower Bounds for Bounded Depth
32: Monotone Circuit Lower Bound for Clique (Razborov’s
33: Monotone Circuit Lower Bound for Clique (Razborov’s
34: Monotone Circuit Lower Bound for Clique (Razborov’s
35: Monotone Circuit Lower Bound for Clique (Razborov’s
36: Monotone Circuit Lower Bound for Clique (Razborov’s
37: Monotone Circuit Lower Bound for Clique (Razborov’s
38: Circuit Lower Bound for Parity by Approximating Circuits
39: Circuit Lower Bound for Parity by Approximating Circuits
40: Circuit Lower Bound for Parity by Approximating Circuits
41: Circuit Lower Bound for Parity using Switching Lemma
42: Circuit Lower Bound for Parity using Switching Lemma
43: Circuit Lower Bound for Parity using Switching Lemma
44: Proof of Hastad’s Switching Lemma I
45: Proof of Hastad’s Switching Lemma II
46: Communication Complexity of a Function
47: Relation Between Communication Complexity and Circuit
48: Relation Between Communication Complexity and Circuit
49: Bounded Width Branching Programs = NC1 (Barrington’s
50: Bounded Width Branching Programs = NC1 (Barrington’s
51: Width 3 Branching Programs = MOD3 o MOD2 circuits
52: Width 3 Branching Programs = MOD3 o MOD2 circuits
53: Uniform AC0 can be simulated by depth 3 Threshold circuits
54: Uniform AC0 can be simulated by depth 3 Threshold circuits
55: ValiantVazirani Theorem I
56: ValiantVazirani Theorem II
57: Natural Proof Barrier (RazborovRudich Theorem) I
58: Natural Proof Barrier (RazborovRudich Theorem) II
59: Pseudorandom Function Generator by Goldreich
60: Pseudorandom Function Generator by Goldreich