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:69dac6b0e0cf6
DTSTART;TZID=America/Toronto:20151110T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20151110T130000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/seminar-nai
 -hui-chia
LOCATION:QNC - Quantum Nano Centre 200 University Avenue West 1201 Waterloo
  ON N2L 3G1 Canada
SUMMARY:Seminar: Nai-Hui Chia
CLASS:PUBLIC
DESCRIPTION:HOW HARD IS DECIDING TRIVIAL VERSUS NON-TRIVIAL IN THE DIHEDRAL
  COSET\nPROBLEM\n\nNAI-HUI CHIA\, PENNSYLVANIA STATE UNIVERSITY\n\nThe dih
 edral coset problem (DCP) is an important open problem in\nquantum algorit
 hms and has been studied since the early days of\nquantum computing. This 
 problem attracts attention even from experts\nin cryptography due to its a
 pplication to the lattice-based\ncryptosystems. It has been shown by Oded 
 Regev in 2005 that the DCP\nhas deep connections to the unique shortest ve
 ctor problem and the\nrandom subset sum problem.
DTSTAMP:20260411T220952Z
END:VEVENT
END:VCALENDAR