BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1023
DTSTAMP:20230914T125947Z
SUMMARY:On the Probabilistic Degrees of Symmetric Boolean Functions
DESCRIPTION:Speaker: S. Venkitesh ((Math\, IITB))\n\nAbstract: \nAbstract:
  The probabilistic degree of a Boolean function f is defined to be the sm
 allest d such that there is a random polynomial P of degree at most d that
  agrees with f at each point with high probability. Introduced by Razborov
  (1987)\, upper and lower bounds on probabilistic degrees of Boolean funct
 ions --- specifically symmetric Boolean functions --- have been used to pr
 ove explicit lower bounds\, design pseudorandom generators\, and devise al
 gorithms for combinatorial problems.\n\nWe will characterize the probabili
 stic degrees of all symmetric Boolean functions up to polylogarithmic fact
 ors over all fields of fixed characteristic (positive or zero).\n\nThis is
  joint work with Srikanth Srinivasan and Utkarsh Tripathi.\n
URL:https://www.tcs.tifr.res.in/web/events/1023
DTSTART;TZID=Asia/Kolkata:20191206T143000
DTEND;TZID=Asia/Kolkata:20191206T153000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR