ConceptTheory & Algos
Natural proofs
A framework describing lower bound techniques that are large and constructible.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
A formalization of the proof strategy used by all known circuit lower bounds at the time, which Razborov and Rudich showed cannot prove that NP does not have polynomial-size circuits under a cryptographic assumption.
Connections
3The lectures that define it or assume it, and the concepts next to it.