Sign inSign in

Valiant-Vazirani theorem

A randomized reduction showing that solving Unique SAT is as hard as solving general SAT, meaning there exists a randomized reduction from SAT to Unique SAT with one-sided error.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 4 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.

Randomized reduction2SAT2Unique SAT2Circuit SAT1Circuit satisfiability (SAT)1Complexity theory1Hashing1NP1

Lecturers

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 1:17:46Approximate counting
    • 50:20Razborov Smolensky Lower Bounds for AC0[p]
    • 1:35Toda's 1st Theorem and the Permanent

Connections

7

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

Concepts3

Lectures4

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.