Sign inSign in

Polynomial time reduction

A method to transform one problem into another using an algorithm that runs in polynomial time.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 6 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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 6:51The Immerman-Szelepcsényi Theorem
    • 4:11Reductions
    • 44:32Time Hierarchy Theorem
  • Michael Sipser

    MIT · Undergraduate

    A reduction from problem A to problem B that can be computed in polynomial time, such that if B is in P then A is in P.
    • 41:26Games, Generalized Geography
    • 2:08NP-Completeness

Lectures that assume it

29

The first 12 are shown.

Connections

45

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

Concepts10

Show 4 more

Lectures35

Show 29 more

2 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.