Strong Exponential Time Hypothesis: no less than O(2^n) algorithm for SAT (proved only with blackbox model)
Quantum Strong Exponential Time Hypothesis: no less than O(2^{n/2}) quantum algorithm for SAT (proved only with blackbox model)
Table of Content