ConceptTheory & Algos
Non-deterministic time complexity
A non-deterministic Turing machine runs in time t(n) if every computational branch halts within t(n) steps on all inputs of length n.
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
3The lectures that define it or assume it, and the concepts next to it.