Sign inSign in

Derandomization

The process of replacing random bits in an algorithm with pseudorandom strings generated deterministically from a short seed.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 2:41Randomized Complexity: RP, coRP, and ZPP
    • 0:21Expander Graph Application 2: Derandomization
    • 21:55Rotate, Compute, Rotate
  • Venkatesan Guruswami

    Carnegie Mellon University · Undergraduate

    The process of removing randomness from an algorithm or complexity class, often replacing random bits with deterministic constructions or hardness assumptions.
    • 59:43BPP (Bounded-Error Probabilistic Polynomial Time) Complexity Class
  • Seth Pettie

    University of Michigan · Research

    The process of converting a randomized algorithm into a deterministic algorithm that uses a magic function to simulate random bits from vertex IDs.
    • 33:22Strange Gaps in the Local Time Hierarchy

Lectures that assume it

1

Connections

11

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

3 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.