ConceptTheory & Algos
Gadget reduction
A reduction that translates instances of one problem to another using structural components called gadgets.
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
2Each in their own terms, from the easiest level.
Michael Sipser
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
Lectures that assume it
1Connections
10The lectures that define it or assume it, and the concepts next to it.