ConceptTheory & Algos
Boolean formula construction for SAT
Constructing a boolean formula that is satisfiable if and only if a Turing machine accepts an input string within a given time bound.
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.