ConceptTheory & Algos
Pseudo-random generator
A generator that takes a short seed of log n bits and expands it to n bits such that efficient polynomial-time machines cannot distinguish it from true randomness.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
A family of efficiently computable functions that stretch a short random seed into a longer string that is computationally indistinguishable from truly random strings.
Lectures that assume it
1Connections
9The lectures that define it or assume it, and the concepts next to it.