Sign inSign in

Search-to-decision reduction

A reduction technique where an algorithm that solves the decision problem (telling whether a solution exists) is used to find a satisfying assignment or solution.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 5 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

1
  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 34:55Search-to-Decision, Padding, Dichotomy Theorems
    • 1:04Instance Checking and the Permanent
    • 1:10:00Ladner's Theorem and Mahaney's Theorem
    • 44:33Oracles, and the Polynomial Time Hierarchy vs. circuits

Connections

10

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

1 lecturer. 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.