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:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69dac69953d6e
DTSTART;TZID=America/Toronto:20170309T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170309T103000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/seminar-sha
 lev-ben-david
LOCATION:DC - William G. Davis Computer Research Centre 200 University Aven
 ue West 1304 Waterloo ON N2L 3G1 Canada
SUMMARY:Seminar: Shalev Ben-David
CLASS:PUBLIC
DESCRIPTION:THE POWER OF RANDOMIZED AND QUANTUM COMPUTATION\n\nSHALEV BEN-D
 AVID\, MASSACHUSETTS INSTITUTE OF TECHNOLOGY\n\nRandomized and quantum co
 mputing offer potential improvements over\ndeterministic algorithms\, and 
 challenge our notion of what should be\nconsidered efficient computation. 
 A fundamental question in complexity\ntheory is to try to understand when 
 these resources help\; on which\ntasks do randomized or quantum algorithms
  outperform deterministic\nones?\n\nIn this talk\, I will describe some of
  my work investigating this\nquestion\, primarily in the query complexity 
 (blackbox) model.
DTSTAMP:20260411T220929Z
END:VEVENT
END:VCALENDAR