|Computer Science/Discrete Mathematics Seminar I|
|Topic:||Progress on algorithmic versions of the Lovasz Local Lemma|
|Affiliation:||University of Maryland, College Park|
|Date:||Monday, April 7|
|Time/Room:||11:15am - 12:15pm/S-101|
There has been substantial progress on algorithmic versions and generalizations of the Lovasz Local Lemma recently, with some of the main ideas getting simplified as well. I will survey some of the main ideas of Moser & Tardos, Pegden, and David Harris & myself in this context.