ConceptTheory & Algos
Shannon's circuit lower bound theorem
A probabilistic counting argument showing that almost all Boolean functions on variables require circuits of size at least .
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.