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:20150308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20151101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6874dd83591a0
DTSTART;TZID=America/Toronto:20151110T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20151110T130000
URL:/institute-for-quantum-computing/events/seminar-nai
 -hui-chia
SUMMARY:Seminar: Nai-Hui Chia
CLASS:PUBLIC
DESCRIPTION:Summary \n\nHOW HARD IS DECIDING TRIVIAL VERSUS NON-TRIVIAL IN 
 THE DIHEDRAL COSET\nPROBLEM\n\nNAI-HUI CHIA\, PENNSYLVANIA STATE UNIVERSIT
 Y\n\nThe dihedral coset problem (DCP) is an important open problem in\nqua
 ntum algorithms and has been studied since the early days of\nquantum comp
 uting. This problem attracts attention even from experts\nin cryptography 
 due to its application to the lattice-based\ncryptosystems. It has been sh
 own by Oded Regev in 2005 that the DCP\nhas deep connections to the unique
  shortest vector problem and the\nrandom subset sum problem.\n 
DTSTAMP:20250714T103547Z
END:VEVENT
END:VCALENDAR