Skip to content

Session 5 - Improved bounds for the sunflower lemma

1,090 views

About this video

Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video

Improves bounds for the sunflower lemma, a foundational result in combinatorics. Teaches combinatorial techniques with applications to complexity theory.

Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.

Part of STOC 2020