BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/921
DTSTAMP:20230914T125943Z
SUMMARY:The Log-Approximate-Rank Conjecture is False
DESCRIPTION:Speaker: Suhail Sherif\n\nAbstract: \nAbstract: The Log-Approxi
 mate-Rank Conjecture was a long-standing conjecture which posited that the
  randomised communication complexity of a function and log of the approxim
 ate rank of its communication matrix are polynomially related.\nIn this wo
 rk\, we introduce a function F that refutes this conjecture. We will discu
 ss a drawback of rank-like measures and see a proof that F has small appro
 ximate rank\, yet is hard for randomised communication (joint work with Ar
 kadev Chattopadhyay and Nikhil Mande).\n
URL:https://www.tcs.tifr.res.in/web/events/921
DTSTART;TZID=Asia/Kolkata:20181127T140000
DTEND;TZID=Asia/Kolkata:20181127T150000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR