ConceptTheory & Algos
NL = coNL
The complexity class of problems solvable by a non-deterministic Turing machine in logarithmic space is closed under complementation.
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.