ConceptTheory & Algos
Nontrivial SAT algorithm
An algorithm whose running time achieves exponential savings over the naive brute-force search.
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 time1K-SAT1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.