ConceptTheory & Algos
Strongly explicit expander graph
An expander graph whose adjacency relationships can be computed in polynomial time relative to the size of the vertex representation.
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.