ConceptTheory & Algos
Mapping reduction
A reduction that maps any instance X of problem A to an instance Y of problem B such that X is in A if and only if Y is in 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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Ryan O'Donnell
Lectures that assume it
1Connections
11The lectures that define it or assume it, and the concepts next to it.
Concepts7
- Polynomial time
- CNF-SAT
- Computability
- Graph
- Log-space reduction
- Transitivity of polynomial-time mapping reduction