BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1224
DTSTAMP:20230914T125955Z
SUMMARY:An almost-efficient deterministic parallel algorithm for Bipartite 
 Perfect Matching
DESCRIPTION:Speaker: Varun Ramanathan\n\nAbstract: \nWe will try to underst
 and the paper "Bipartite Perfect Matching is in quasi-NC" by Fenner\, Gurj
 ar and Thierauf (2016). They achieved an almost complete derandomization o
 f the Isolation Lemma (Mulmuley\, Vazirani\, Vazirani) for perfect matchin
 gs in bipartite graphs and thus the result stated in the title. There are 
 no prerequisites for the talk\; familiarity with linear programming would 
 be helpful.\n
URL:https://www.tcs.tifr.res.in/web/events/1224
DTSTART;TZID=Asia/Kolkata:20220722T160000
DTEND;TZID=Asia/Kolkata:20220722T170000
LOCATION:A201
END:VEVENT
END:VCALENDAR