YoVDO

Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local Lemma

Offered By: ACM SIGPLAN via YouTube

Tags

Probabilistic Methods Courses Combinatorics Courses Probability Theory Courses Formal Verification Courses Hypergraphs Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 32-minute conference talk from CPP 2024 that delves into formalizing probabilistic methods for combinatorial structures using the Lovász Local Lemma. Learn how Chelsea Edmonds and Lawrence Paulson present a modular framework in Isabelle/HOL to translate intuitive probabilistic arguments into formal proofs. Discover the challenges and insights in formalizing the basic existence method and the first formalization of the Lovász local lemma. Gain understanding of general, reusable formal probabilistic lemmas for combinatorial structures and their application to classic lemmas on hypergraph colorings. Examine the gaps between intuitive probabilistic reasoning and formal proofs, and see how this work contributes to expanding formalized libraries of combinatorial mathematics using probability.

Syllabus

[CPP'24] Formal Probabilistic Methods for Combinatorial Structures using the Lovász Local ...


Taught by

ACM SIGPLAN

Related Courses

Analytic Combinatorics, Part I
Princeton University via Coursera
Analytic Combinatorics, Part II
Princeton University via Coursera
Analytic Combinatorics
Princeton University via Coursera
Principles of Computing (Part 1)
Rice University via Coursera
Combinatorics and Probability
Moscow Institute of Physics and Technology via Coursera