ConceptTheory & Algos
Hardness versus randomness paradigm
A paradigm that uses the assumption that hard problems exist to construct pseudorandom generators that can derandomize 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.
Complexity classes like P and NP1Pseudorandom generator1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.