Sign inSign in

Turing reducibility

A problem is Turing-reducible to SAT if there is a polynomial-time algorithm that can solve the problem assuming the ability to solve SAT queries.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1

    Lectures that assume it

    1

    Connections

    5

    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.