ConceptTheory & Algos
NL-completeness
A language is NL-complete if it is in NL and every language in NL is log-space reducible to it.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
A language is -complete if is in and every language in reduces to under a suitable reduction.
Connections
7The lectures that define it or assume it, and the concepts next to it.