Sign inSign in

Gadget reduction

A reduction that translates instances of one problem to another using structural components called gadgets.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    A technique in NP-completeness reductions where substructures called gadgets are built in the target language to simulate variables and clauses of a Boolean formula.
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 1:15Dinur's Proof of the PCP Theorem: Outline

Lectures that assume it

1

Connections

10

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

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.