ConceptTheory & Algos
Kannan's theorem
A theorem stating that there exists a language in \Σ₄ P that does not have polynomial-sized circuits.
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
4The lectures that define it or assume it, and the concepts next to it.