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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dfcab5cf17d
DTSTART;TZID=America/Toronto:20231127T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20231127T130000
URL:https://uwaterloo.ca/computer-science/events/seminar-algorithms-and-com
 plexity-top-down-lower-bounds-for-depth-four-circuits
LOCATION:Mathematics & Computer Building 200 University Avenue West Hybrid:
  MC 5501 | Online seminar Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar • Algorithms and Complexity • Top-Down Lower Bounds for
 \nDepth-Four Circuits
CLASS:PUBLIC
DESCRIPTION:PLEASE NOTE: THIS SEMINAR WILL TAKE PLACE IN MC 5501 AND ONLINE
 .\n\nMIKA GÖÖS\, ASSISTANT PROFESSOR\n_Theory Group\, École polytechniq
 ue fédérale de Lausanne_\n\nWe present a top-down lower-bound method for
  depth-4 Boolean circuits.\nIn particular\, we give a new proof of the wel
 l-known result that the\nparity function requires depth-4 circuits of size
  exponential in\nn^{1/3}. Our proof is an application of robust sunflowers
  and block\nunpredictability.\n\n_Joint with Artur Riazanov\, Anastasia So
 fronova\, and Dmitry Sokolov._
DTSTAMP:20260415T172821Z
END:VEVENT
END:VCALENDAR