ConceptTheory & Algos
Worst-case hardness
The assumption that a problem like 3-SAT does not have a small circuit that gets it correct on every input.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
Statements like P does not equal NP where no algorithm gets the right answer on every instance.
Connections
7The lectures that define it or assume it, and the concepts next to it.