BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Vishesh Jain (Stanford)
DTSTART:20210618T130000Z
DTEND:20210618T140000Z
DTSTAMP:20260423T003240Z
UID:WCS/30
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/30/">Tow
 ards the sampling Lovász Local Lemma</a>\nby Vishesh Jain (Stanford) as p
 art of Warwick Combinatorics Seminar\n\n\nAbstract\nFor a constraint satis
 faction problem which satisfies the condition of the Lovász local lemma (
 LLL)\, the celebrated algorithm of Moser and Tardos allows one to efficien
 tly find a satisfying assignment. In the past few years\, much work has go
 ne into understanding whether one can efficiently sample from (approximate
 ly) the uniform distribution on satisfying assignments under LLL-like cond
 itions. I will discuss recent progress on this problem\, joint with Huy Tu
 an Pham (Stanford) and Thuy Duong Vuong (Stanford).\n
LOCATION:https://researchseminars.org/talk/WCS/30/
END:VEVENT
END:VCALENDAR