Sign inSign in

3SAT

The problem of checking if a given CNF formula with at most three literals per clause is satisfiable.
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

3

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    The problem of determining if a Boolean formula in conjunctive normal form with exactly three literals per clause is satisfiable.
    • 5:51Complexity: P, NP, NP-completeness, Reductions
  • Michael Sipser

    MIT · Undergraduate

    The satisfiability problem restricted to 3CNF formulas.

Lectures that assume it

7

Connections

19

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.