ConceptTheory & Algos
Running time of a nondeterministic algorithm
The maximum running time over all branches of the nondeterministic algorithm.
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 time1Nondeterminism1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.