ConceptTheory & Algos
K-SAT algorithm improvements
Algorithms that solve k-SAT in time , beating the trivial 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.
Exponential time complexity1K-SAT1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.