ConceptTheory & Algos
Non-deterministic running time
The running time of a non-deterministic algorithm is defined as the maximum running time over every branch.
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.
Algorithm running time1Non-deterministic Turing machine1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.