BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1503
DTSTAMP:20241212T044452Z
SUMMARY:Polynomial time local decision
DESCRIPTION:Speaker: Soumyadeep Paul (TIFR)\n\nAbstract: \nDistributed loca
 l decision studies the power of distributed algorithms. Typically\, the pr
 ocessors are assumed to have unbounded power for local computation\, focus
 sing only on the communication between the parties. In this talk\, I will 
 be introducing the LOCAL model of distributed computing and local decision
  and some complexity classes related to them. We will then look at some co
 mplexity classes which take into account local computation as well and the
 ir connections to centralized complexity classes.\n \nThis talk is based 
 on this paper: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.
 OPODIS.2023.27\n
URL:https://www.tcs.tifr.res.in/web/events/1503
DTSTART;TZID=Asia/Kolkata:20241212T160000
DTEND;TZID=Asia/Kolkata:20241212T170000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR