ConceptTheory & Algos
Feige's R3Sat hypothesis
For any large constant c, there is no polynomial-time algorithm that outputs certificates of unsatisfiability with high probability for random 3-Sat 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.