ConceptTheory & Algos
Exact 3-satisfiability
3SAT with the restriction that every clause has exactly three distinct literals and three distinct variables.
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
2Each in their own terms, from the easiest level.
Ryan O'Donnell
A constraint satisfaction problem where every clause has to have exactly three literals per clause.
Connections
7The lectures that define it or assume it, and the concepts next to it.