ConceptTheory & Algos
Polynomial time mapping reduction
A mapping reduction that runs in polynomial time, meaning there exists a polynomial-time computable function R such that x is in one language if and only if R(x) is in the other.
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
3Each in their own terms, from the easiest level.
David Witmer
A mapping reduction that runs in polynomial time, written as , showing that one problem can be efficiently transformed into another.Yu Zhao
A function R that maps instances of language A to instances of language B in polynomial time, such that an instance x is in A if and only if R(x) is in B.
Connections
8The lectures that define it or assume it, and the concepts next to it.