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:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20211107T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dfde8c7a80e
DTSTART;TZID=America/Toronto:20221028T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20221028T140000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-new-lower-bounds-for-set-multilinear-formulas
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West Hybrid: DC 1304 | Online seminar Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity • New Lower Bounds for Set\
 nMultilinear Formulas
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS SEMINAR WILL TAKE PLACE IN DC 1304 AND ONLINE
 .\n\nSHUBHANGI SARAF\, ASSOCIATE PROFESSOR\n_Department of Mathematics\, D
 epartment of Computer\nScience\, University of Toronto_\n\nThe recent exc
 iting breakthrough by Limaye\, Srinivasan\, and Tavenas\nshowing superpoly
 nomial lower bounds for constant-depth algebraic\ncircuits has underscored
  the importance of studying the complexity of\nset multilinear formulas.
DTSTAMP:20260415T185300Z
END:VEVENT
END:VCALENDAR