Sign inSign in

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.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 definitions
Watch it explained

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

3

Each in their own terms, from the easiest level.

  • David Witmer

    Carnegie Mellon University · Undergraduate

    A mapping reduction that runs in polynomial time, written as ≤P\le_P, showing that one problem can be efficiently transformed into another.
    • 0:37NP-Completeness Reductions
  • Yu Zhao

    Carnegie Mellon University · Undergraduate

    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.
    • 0:26NP-Completeness and the Cook-Levin Theorem

Connections

8

The lectures that define it or assume it, and the concepts next to it.

Concepts5

Lectures3

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.