ConceptTheory & Algos
Succinct 3SAT
In NEXPTIME because Cook-Levin theorem has quasi-linear poly-log time versions.
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.
Circuit complexity23SAT1Boolean circuit1Complexity classes1Cook-Levin theorem1NEXPTIME1Polynomial time reduction1
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.