ConceptTheory & Algos
Succinct SAT
A satisfiability problem where the input formula is represented succinctly by a small circuit rather than explicitly written out.
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
1Ryan O'Donnell
Connections
7The lectures that define it or assume it, and the concepts next to it.