Session 7A - Fast Sampling and Counting k-SAT Solutions in the Local Lemma Regime
443 views
About this video
Advanced · Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by videoDevelops fast sampling and counting algorithms for k-SAT solutions using the Lovász local lemma. Teaches advanced probabilistic algorithmic techniques for constraint satisfaction.
Video by Association for Computing Machinery (ACM), played through YouTube's embedded player.
Part of STOC 2020