Sign inSign in

Hardness versus randomness

A paradigm in complexity theory showing that computational hardness can be traded for pseudorandomness to derandomize efficient probabilistic algorithms.
as Avi Wigderson defines itInstitute for Advanced Study
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.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A paradigm showing that if there are functions in complexity classes like NEXP that require large circuits, then randomized algorithms can be derandomized.
    • 23:38Instance Checking and the Permanent

Connections

6

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.