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:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69e3f9f45482e
DTSTART;TZID=America/Toronto:20230515T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20230515T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/co-reading-g
 roup-jacob-skitsko
SUMMARY:C&O Reading Group - Jacob Skitsko
CLASS:PUBLIC
DESCRIPTION:TITLE: The matching polytope has exponential extension complexi
 ty\n\nSpeaker:\n Jacob Skitsko\n\nAffiliation:\n University of Waterloo\n\
 nLocation:\n MC 6029\n\nABSTRACT: This Friday we will build off of some p
 revious results by\nlooking at the paper “The matching polytope has expo
 nential\nextension complexity” by Thomas Rothvoss! At the beginning of t
 he\nsemester\, we saw that the matching (and TSP) polytopes cannot be\nexp
 ressed by a polynomial sized symmetric LP.
DTSTAMP:20260418T213900Z
END:VEVENT
END:VCALENDAR