ConceptTheory & Algos
NL
The class of decision problems solvable by a non-deterministic Turing machine using logarithmic space.
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
Michael Sipser
The class of decision problems solvable by a non-deterministic Turing machine using logarithmic space.
Lectures that assume it
2Connections
13The lectures that define it or assume it, and the concepts next to it.