ConceptTheory & Algos
Reduction from 3SAT to E3SAT
A polynomial-time algorithm that transforms any 3CNF formula into an equivalent 3CNF formula where every clause has exactly three distinct literals.
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.