Sign inSign in

CNF-SETH

A variation of SETH stating that CNF SAT with mm clauses and nn variables requires 2(1−ϵ)npoly(m)2^{(1 - \epsilon)n} \text{poly}(m) time.
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.

    Concepts2

    Lecture1

    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.