Sign inSign in

Downward self-reducibility

A property where solving a problem on a large instance is reducible to solving it on smaller instances by fixing inputs.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 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.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 0:58Instance Checking and the Permanent
    • 42:49Oracles, and the Polynomial Time Hierarchy vs. circuits

Connections

8

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.