ConceptTheory & Algos
Nondeterministic polynomial time (Nondet-NP)
A class of languages decided by a nondeterministic Turing machine running in polynomial time.
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.