BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1794
DTSTAMP:20261030T054450Z
SUMMARY:Multipartition Communication Complexity and Algebraic Complexity
DESCRIPTION:Speaker: Srikanth Srinivasan (university of Copenhagen)\n\nAbst
 ract: \nThe classical model of communication complexity\, introduced by Ya
 o\, has been an object of intense study over the years with many applicati
 ons to complexity theory\, including circuit complexity\, proof complexity
 \, extended formulations and so on. I will define a relatively understudi
 ed version of this communication model called Multipartition communication
  complexity\, which was introduced in work of Duriš\, Hromkovič\, Jukna\
 , Sauerhoff\, and Schnitger. Using a suitable lower bound for this model\
 , we can derive a nearly optimal monotone vs. non-monotone separation for
  algebraic circuits\, which I will sketch. Joint work with Cavalar\, Fabri
 s\, Mukhopadhyay and Yehudayoff.\n \nBio: Srikanth Srinivasan received hi
 s PhD in 2011 from IMSc in Chennai\, where he was advised by V Arvind. He 
 is on the faculty at the computer science department (DIKU) at the Univers
 ity of Copenhagen after having spent time at IAS\, DIMACS\, IIT Bombay (Ma
 thematics dept) and Aarhus University. His research interests span all of 
 theoretical computer science in theory but in practice are limited to comp
 lexity theory and adjacent areas.\n
URL:https://www.tcs.tifr.res.in/web/events/1794
DTSTART;TZID=Asia/Kolkata:20261211T101500
DTEND;TZID=Asia/Kolkata:20261211T110000
LOCATION:Homi Bhabha Auditorium
END:VEVENT
END:VCALENDAR