Computer Science/Discrete Mathematics Seminar I
Progress on algorithmic versions of the Lovasz Local Lemma
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.
Date & Time
April 07, 2014 | 11:15am – 12:15pm
Location
S-101Speakers
Affiliation
University of Maryland, College Park