ConceptTheory & Algos
General reducibility
A reducibility where a solver for B is used as a subroutine to solve A in the most general possible way, which is useful for proving undecidability.
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
4The lectures that define it or assume it, and the concepts next to it.