BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/808
DTSTAMP:20230914T125939Z
SUMMARY:On Circuit Depth of Symmetric Boolean Functions
DESCRIPTION:Speaker: Tulasi mohan Molli\n\nAbstract: \nA boolean circuit is
a natural model of computation for Boolean functions. Size and Depth of a
circuit are two measures of complexity of the circuit.\n\nA long standing
open problem is to show a super logarithmic lower-bound for the depth of
the circuit computing an explicit function.\n\nSymmetric functions are a c
lass of functions where permuting the input bits does not change the value
output or in other words\, the function depends only on the number 1's in
the input.\n\nIn this talk\, we will see Valiant's construction of a loga
rithmic depth circuit for the majority function which in turn gives a loga
rithmic depth circuit for any symmetric function.\n
URL:https://www.tcs.tifr.res.in/web/events/808
DTSTART;TZID=Asia/Kolkata:20170915T171500
DTEND;TZID=Asia/Kolkata:20170915T181500
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR