ConceptTheory & Algos
Nondeterministic algorithm
An algorithm that accepts if at least one branch accepts, with running time defined as the maximum running time over all branches.
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
1Connections
4The lectures that define it or assume it, and the concepts next to it.