ConceptTheory & Algos
L and NL classes
Complexity classes corresponding to languages decidable in logarithmic space deterministically (L) or non-deterministically (NL).
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.
Deterministic and non-deterministic Turing machines1Log space1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.