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:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:68277190e06a4
DTSTART;TZID=America/Toronto:20240802T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240802T163000
URL:/combinatorics-and-optimization/events/distinguishe
 d-tutte-lecture-ryan-odonnell
SUMMARY:Distinguished Tutte Lecture - Ryan O'Donnell
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Quartic quantum speedups for planted infere
 nce\n\nSPEAKER:\n Ryan O'Donnell\n\nAFFILIATION:\n CMU\n\nLOCATION:\n MC 5
 501\n\nABSTRACT: Consider the following task (\"noisy 4XOR\")\, arising i
 n\nCSPs\, optimization\, and cryptography.  There is a 'secret' Boolean\n
 vector x in {-1\,+1}^n.  One gets m randomly chosen pairs (S\, b)\,\nwher
 e S is a set of 4 coordinates from [n] and b is x^S := prod_{i in\nS} x_i
  with probability 1-eps\, and -x^S with probability eps.  Can\nyou tell t
 he difference between the cases eps = 0.1 and eps = 0.5? \n 
DTSTAMP:20250516T171040Z
END:VEVENT
END:VCALENDAR