Sign inSign in

Turing reduction

A reduction where an algorithm for solving one problem can make multiple adaptive calls to an oracle solving another problem in polynomial time.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 37:37Hardness within P
    • 42:30Toda's 1st Theorem and the Permanent

Lectures that assume it

2

Connections

13

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.