Music |
Video |
Movies |
Chart |
Show |
Algorithms for NP-Hard Problems (Section 23.5: The Exponential Time Hypothesis) (Tim Roughgarden Lectures) View |
Exponential time hypothesis (WikiAudio) View |
Impagliazzo--Wigderson, and Nisan's PRGs || @ CMU || Lecture 12b of CS Theory Toolkit (Ryan O'Donnell) View |
STOC24 1 A 3 Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis (SIGACT EC) View |
Ladners Theorem (NLogSpace) View |
(Beeyond Ideas) View |
Ladner's theorem proof by assuming exponential time hypothesis (Math Geeks) View |
P vs. NP and the Computational Complexity Zoo (hackerdashery) View |
The Central Limit Theorem, Clearly Explained!!! (StatQuest with Josh Starmer) View |
BP V: Hardness, thesis and open problems (Sariel Har-Peled) View |