Sign inSign in

K-SAT algorithm improvements

Algorithms that solve k-SAT in time O((2−2/k)n)O((2 - 2/k)^n), beating the trivial 2n2^n bound.
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.

Exponential time complexity1K-SAT1

Lecturers

1

    Connections

    2

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

    Concept1

    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.