Sign inSign in

Exponential time algorithms for 3-coloring

Solving graph 3-coloring faster than brute force 3n3^n time, such as using O(1.33n)O(1.33^n) time bounds.
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.