Sign inSign in

Random self-reducibility

A property where a problem can be solved in the worst case with high probability by reducing it to instances of the same problem on random inputs.
as Ryan O'Donnell 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.

Lecturers

2

Each in their own terms, from the easiest level.

  • Shafi Goldwasser

    Ruhr University Bochum · Research

    A property where solving a problem on a worst-case instance can be reduced to solving it on random instances drawn from a specific distribution and combining the solutions.
    • 35:43What Can the Theory of Cryptography Tell Us About AI Verification?

Connections

5

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.