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:20120311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20121104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d940d884d19
DTSTART;TZID=America/Toronto:20130128T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20130128T233000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/thomas-vidi
 ck-complexity-entangled-games-hardness-results
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Thomas Vidick: The complexity of entangled games: hardness results 
 and\napproximation algorithms
CLASS:PUBLIC
DESCRIPTION:Thomas Vidick\, Massachusetts Institute of Technology
DTSTAMP:20260410T182632Z
END:VEVENT
END:VCALENDAR