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:683394935dfb7
DTSTART;TZID=America/Toronto:20170309T103000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170309T103000
URL:/institute-for-quantum-computing/events/seminar-sha
 lev-ben-david
SUMMARY:Seminar: Shalev Ben-David
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTHE POWER OF RANDOMIZED AND QUANTUM COMPUTATION\n\n
 SHALEV BEN-DAVID\, MASSACHUSETTS INSTITUTE OF TECHNOLOGY\n\nRandomized an
 d quantum computing offer potential improvements over\ndeterministic algor
 ithms\, and challenge our notion of what should be\nconsidered efficient c
 omputation. A fundamental question in complexity\ntheory is to try to unde
 rstand when these resources help\; on which\ntasks do randomized or quantu
 m algorithms outperform deterministic\nones?\n\nIn this talk\, I will desc
 ribe some of my work investigating this\nquestion\, primarily in the query
  complexity (blackbox) model.\n 
DTSTAMP:20250525T220715Z
END:VEVENT
END:VCALENDAR