ConceptTheory & Algos
Configuration graph construction
An explicit construction of all vertices (configurations) and edges (transitions) of a non-deterministic machine's computation graph 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.