ConceptTheory & Algos
Non-trivial SAT algorithm
An algorithm for SAT that achieves super-polynomial savings over 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.
Complexity classes1SAT1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.