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:68313e3d5322a
DTSTART;TZID=America/Toronto:20170201T114500
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20170201T114500
URL:/institute-for-quantum-computing/events/seminar-mat
 hieu-lauriere
SUMMARY:Seminar: Mathieu Lauriere
CLASS:PUBLIC
DESCRIPTION:Summary \n\nEXTENDED LEARNING GRAPHS FOR TRIANGLE FINDING\n\nMA
 THIEU LAURIERE\, NEW YORK UNIVERSITY\, SHANGHAI\n\nIn this talk we presen
 t new quantum algorithms for Triangle Finding\nimproving its best previous
 ly known quantum query complexities for\nboth dense and spare instances. F
 or dense graphs on n vertices\, we get\na query complexity of O(n^{5/4}) w
 ithout any of the extra logarithmic\nfactors present in the previous algor
 ithm of Le Gall [FOCS’14]. For\nsparse graphs we also improve some of th
 e results obtained by Le Gall\nand Nakajima [ISAAC’15].\n 
DTSTAMP:20250524T033421Z
END:VEVENT
END:VCALENDAR