ConceptTheory & Algos
Strong exponential time hypothesis
The assumption that for any delta, there exists a k such that k-SAT requires two to the one minus delta times n time.
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 time hypothesis5Exponential time complexity2K-SAT2NP-completeness2Brute force search1CNF-SAT1ETH1Exponential time1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Ryan O'Donnell
Barna Saha
The assumption that for k-SAT, it is not even possible to have a algorithm.
Connections
13The lectures that define it or assume it, and the concepts next to it.