ConceptTheory & Algos
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.
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
1Lectures that assume it
1Connections
5The lectures that define it or assume it, and the concepts next to it.