Sign inSign in

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.
as Venkatesan Guruswami defines itCarnegie Mellon University
Watch it explained

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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A family of efficiently computable functions that stretch a short random seed into a longer string that is computationally indistinguishable from truly random strings.
    • 18:18Hardness vs. Randomness II

Lectures that assume it

1

Connections

9

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.