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:20190310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cebc5125110
DTSTART;TZID=America/Toronto:20190531T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20190531T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-anurag-anshu
LOCATION:MC - Mathematics & Computer Building 200 University Avenue West 55
 01 Waterloo ON N2L 3G1 Canada
SUMMARY:Tutte Colloquium - Anurag Anshu
CLASS:PUBLIC
DESCRIPTION:TITLE: Quantum Log-Approximate-Rank Conjecture is also False\n
 \nSpeaker:\n Anurag Anshu\n\nAffiliation:\n Institute for Quantum Computin
 g - University of Waterloo\n\nRoom:\n MC 5501\n\nABSTRACT:\n\nIn a recent 
 breakthrough result\, Chattopadhyay\, Mande and Sherif [ECCC\nTR18-17] sho
 wed an exponential separation between the log approximate\nrank and random
 ized communication complexity of a total\nfunction `f'\, hence refuting 
 the log approximate rank conjecture of\nLee and Shraibman [2009].
DTSTAMP:20260402T185825Z
END:VEVENT
END:VCALENDAR