ConceptTheory & Algos
Hardness vs randomness paradigm
The hardness versus randomness paradigm is the concept that strong circuit lower bounds for certain complexity classes allow the construction of pseudo-random generators to derandomize randomized algorithms.
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
5The lectures that define it or assume it, and the concepts next to it.