ConceptTheory & Algos
Non-deterministic polynomial time algorithm
An algorithm that uses non-determinism (such as go-to-both branches) and decides a language within polynomial time bounds.
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.