Algorithmic Aspects of The Lovász Local Lemma
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact M.Jenssen.
The Lovász Local Lemma (LLL) is a powerful probabilistic tool for establishing the existence of objects that satisfy certain properties. The breakthrough of Moser and Tardos that made the LLL algorithmic (for which they received the Gödel Prize this year), along with follow-up works revealed that the LLL has intimate connections with a rich class of stochastic local search algorithms. In this talk, I will survey this line of work through the perspective of recent unifying results.
__
https://bham-ac-uk.zoom.us/j/83022685017?pwd=L1RQclI2dmIvL2RXeUNCblpuanlBUT09
Meeting ID: 830 2268 5017
Passcode: 101833
This talk is part of the Combinatorics and Probability seminar series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|