Sign inSign in

Quantum strong exponential time hypothesis

Conjectures that no quantum algorithm for SAT can run in time like (2−0.00001)n(\sqrt{2} - 0.00001)^n.
as Ryan O'Donnell defines itCarnegie Mellon University
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.

Lecturers

1

    Connections

    3

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

    1 lecturer. 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.