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:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6872de5fb72b2
DTSTART;TZID=America/Toronto:20250604T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20250604T130000
URL:/computer-science/events/seminar-algorithms-and-com
 plexity-polynomial-time-pit-from-almost-necessary-assumptions
SUMMARY:Seminar • Algorithms and Complexity • Polynomial-Time PIT from\
 n(Almost) Necessary Assumptions 
CLASS:PUBLIC
DESCRIPTION:Summary \n\nPLEASE NOTE: THIS SEMINAR WILL TAKE PLACE IN DC 130
 4 AND ONLINE.\n\nDEEPANSHU KUSH\, PHD STUDENT\n_Department of Computer Sci
 ence\, University of Toronto_\n 
DTSTAMP:20250712T221455Z
END:VEVENT
END:VCALENDAR