BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/739
DTSTAMP:20230914T125936Z
SUMMARY:Relating Communication Protocols and Polynomials
DESCRIPTION:Speaker: Suhail Sherif\n\nAbstract: \nLee and Zhang showed that
the communication complexity of "f composed with g" is high when f is har
d to approximate with a low degree polynomial (also g has to be from a goo
d class of functions\, more details will be given in the talk). In this ta
lk\, we will look at a proof of this result by transforming a communicatio
n protocol for "f composed with g" into a polynomial for f.\n
URL:https://www.tcs.tifr.res.in/web/events/739
DTSTART;TZID=Asia/Kolkata:20161230T160000
DTEND;TZID=Asia/Kolkata:20161230T173000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR