ConceptTheory & Algos
Recursive QBF construction
A second attempt to construct a quantified boolean formula for a Turing machine by recursively dividing the computation step count in half using an intermediate configuration .
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.