ConceptTheory & Algos
NL-complete
A language is NL-complete if is in NL and every language in NL is log-space reducible to .
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.