BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7d07760e4
DTSTART;TZID=America/Toronto:20240729T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240729T140000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-prashant-gokhale
SUMMARY:C&O Reading Group - Prashant Gokhale
CLASS:PUBLIC
DESCRIPTION:TITLE: NC algorithm to find perfect matching in planar graphs\
 n\nSPEAKER:\n Prashant Gokhale\n\nAFFILIATION:\n University of Waterloo\n\
 nLOCATION:\n MC 6029\n\nABSTRACT: Is perfect matching in NC? That is\, is
  there a\ndeterministic fast parallel algorithm for it? This has been an\n
 outstanding open question in theoretical computer science for over\nthree 
 decades\, ever since the discovery of RNC matching algorithms.\nWithin thi
 s question\, the case of planar graphs has remained an\nenigma: On the one
  hand\, counting the number of perfect matchings is\nfar harder than findi
 ng one (the former is #P-complete and the latter\nis in P)\, and on the ot
 her\, for planar graphs\, counting has long been\nknown to be in NC wherea
 s finding one has resisted a solution. 
DTSTAMP:20260403T084039Z
END:VEVENT
END:VCALENDAR