ConceptTheory & Algos
Williams' theorem '11
A theorem showing the existence of a language in NEX that cannot be computed by constant-depth polynomial-size circuits with AND, OR, NOT, and mod gates.
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
1Connections
2The lectures that define it or assume it, and the concepts next to it.