ConceptTheory & Algos
Turing reduction (Cook reduction)
A language A reduces to B in polynomial time with a Turing reduction if A is in , meaning A can be solved in polynomial time given an oracle for B.
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
1Connections
3The lectures that define it or assume it, and the concepts next to it.