ConceptTheory & Algos
Nisan-Wigderson theorem
A theorem stating that if there exists a language in E that is hard for exponential-size circuits, then BPP equals P via a PRG constructed using combinatorial designs.
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
4The lectures that define it or assume it, and the concepts next to it.