BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1218
DTSTAMP:20230914T125955Z
SUMMARY:On Complexity measures of Boolean functions
DESCRIPTION:Speaker: Tulasi mohan Molli\n\nAbstract: \nBoolean functions ca
 pture various problems and situations arising in computer science and othe
 r areas. In this synopsis\, we study boolean functions using two complexit
 y measures.\nIn the first part of the talk\, we will focus on the Probabil
 istic degree of OR over Reals. This is based on joint work with Bhandari\,
  Harsha and Srinivasan. In this part\, we will look at the construction of
  a Probabilistic Polynomial for OR over Reals\, which improves on the prev
 ious best construction due to Toda-Ogiwara and Beigel\, Tarui\, Reingold a
 nd Speilman.  We will also look at a lower bound on the Probabilistic deg
 ree of OR which matches our upper bound construction in a restricted setti
 ng.\n\nIn the second part\, we will look at a bunch of complexity measures
  which arise out of the Fourier representation of Boolean functions and st
 udy the relationship between them.  This is based on joint work with Chak
 raborty\, Mande\, Mittal\, Paraashar and Sanyal. In this part\, we will fo
 cus on a couple of upper bounds on Fourier rank in terms of Fourier sparsi
 ty\, weight\, Fourier max-entropy and  Fourier max-rank entropy. We will 
 also exhibit functions which match these bounds.\n\nMeeting URL : https://
 zoom.us/j/98513182619?pwd=WjZDWFhVVVdYM0NhZGZjdGtObjhvQT09\nMeeting ID : 9
 8513182619\nPasscode : 59290580\n
URL:https://www.tcs.tifr.res.in/web/events/1218
DTSTART;TZID=Asia/Kolkata:20220715T140000
DTEND;TZID=Asia/Kolkata:20220715T150000
LOCATION:Via Zoom
END:VEVENT
END:VCALENDAR