Sign inSign in

SAT

The counting problem of determining the exact number of satisfying assignments for a given Boolean formula.
as Michael Sipser defines itMITThe 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.

Boolean formula2Boolean logic1Boolean satisfiability (SAT)1Computational complexity1coNP1NP-complete1NP-hardness1Satisfiability problem1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Michael Sipser

    MIT · Undergraduate

    • 1:10:28P and NP, SAT, Poly-Time Reducibility
    • 24:26Space Complexity, PSPACE, Savitch's Theorem
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A famous and well-studied problem of determining if a boolean formula is satisfiable.
    • 10:35Quantum Algorithms Synthesis II: Grover's Search & Circuit SAT

Lectures that assume it

19

The first 12 are shown.

Connections

30

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

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