ConceptTheory & Algos
NC
The complexity class corresponding to problems solvable by circuit families of polylogarithmic depth and polynomial size.
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
1Ryan O'Donnell
Connections
6The lectures that define it or assume it, and the concepts next to it.