ConceptTheory & Algos
Reduction from SAT to 3SAT
A polynomial-time reduction that converts any general boolean formula into a 3CNF formula while preserving satisfiability.
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
4The lectures that define it or assume it, and the concepts next to it.