Sign inSign in

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.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 7 definitions
Watch it explained

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

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    • 10:46Grover's Algorithm
    • 12:15Hardness within P
    • 6:18The Complexity Class NP
    • 13:41Beyond Worst-Case Analysis
    • 13:25Quantum Algorithms Synthesis II: Grover's Search & Circuit SAT
  • Barna Saha

    UC Berkeley · Graduate

    The assumption that for k-SAT, it is not even possible to have a 2(1−ϵ)n2^{(1-\epsilon)n} algorithm.
    • 0:56Efficient Fine-Grained Algorithms

Connections

13

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.