Sign inSign in

Cook-Levin theorem

A theorem stating that every language in NP reduces in polynomial time to CIRCUIT-SAT.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 8 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

3

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 1:20:36The Complexity Class NP
    • 10:20Toda's 1st Theorem and the Permanent
    • 30:50From P-Completeness to PSPACE-Completeness
    • 0:12Quasilinear Cook–Levin Theorem
  • Michael Sipser

    MIT · Undergraduate

    The theorem stating that the Boolean satisfiability problem (SAT) is NP-complete.
  • Yu Zhao

    Carnegie Mellon University · Undergraduate

    A theorem stating that every language in NP can be reduced to SAT in polynomial time.
    • 10:30NP-Completeness and the Cook-Levin Theorem

Lectures that assume it

1

Connections

17

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

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