ConceptTheory & Algos
Nondeterministic time (NP)
A computation is said to overall accept if and only if at least one leaf sort of locally accepts.
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.
Computation tree1Turing machine1
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.