Sign inSign in

Exact 3-satisfiability

3SAT with the restriction that every clause has exactly three distinct literals and three distinct variables.
as David Witmer defines itCarnegie Mellon University
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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A constraint satisfaction problem where every clause has to have exactly three literals per clause.
    • 20:45CSP Approximability: Optimization and Certification

Connections

7

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

Concepts5

Lectures2

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.