ConceptTheory & Algos
Nondeterministic polynomial time simulation
A nondeterministic computation can be simulated deterministically by pre-guessing all choices made at branching points using a guess string.
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.