ConceptTheory & Algos
-SSAT-Refuter
A polynomial-time algorithm that takes a formula , outputs either 'const' or 'no comment' without ever making mistakes on satisfiable formulas, and correctly identifies unsatisfiable formulas with high probability for random instances.
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
3The lectures that define it or assume it, and the concepts next to it.