ConceptTheory & Algos
Determinant completeness
The determinant family is complete for algebraic quasi-polynomial sized circuits under quasi-polynomial size projection reductions.
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
3The lectures that define it or assume it, and the concepts next to it.