Sign inSign in

Lovasz local lemma

A tool in probability theory for proving the existence of combinatorial objects with certain properties.
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.

Combinatorics1Distributed graph algorithms1Probability theory1Sublogarithmic time complexity1

Lecturers

2

Each in their own terms, from the easiest level.

  • Seth Pettie

    University of Michigan · Research

    A combinatorial lemma used in distributed computing that serves as a completeness result for sublogarithmic randomized time complexity.
    • 14:10Strange Gaps in the Local Time Hierarchy

Connections

3

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

Concept1

Lectures2

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.