Sign inSign in

Pseudorandom generator

A mapping that takes a short seed string and expands it to a long pseudorandom string that cannot be distinguished from true randomness by efficient algorithms.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 6 definitions
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.

Randomness3Boolean circuit2Circuit2Circuit complexity2Uniform computability2BPP1BPP vs P1Complexity classes1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 10:04Randomized Complexity: RP, coRP, and ZPP
    • 10:03Impagliazzo T Wigderson, and Nisan's Pseudorandom Generators
    • 1:37k-wise Independent Generators
    • 1:16:38Why is P vs. NP Difficult?
    • 1:48Hardness vs. Randomness II

Lectures that assume it

4

Connections

18

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

1 lecturer. 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.