BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.18.2//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Ashoka University
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20150101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20161110T163000
DTEND;TZID=UTC:20161110T173000
DTSTAMP:20211006T222937Z
CREATED:20211006T222937Z
LAST-MODIFIED:20211006T222937Z
UID:20191-1478795400-1478799000@www.ashoka.edu.in
SUMMARY:The power of negations in Boolean circuits
DESCRIPTION:Abstract: The building blocks of the digital age computers are gates implementing Boolean functions. Every Boolean function can be implemented using just binary AND\, binary OR\, and unary NOT gates. Furthermore\, certain Boolean functions\, the monotone functions\, do not even need the NOT gates. Nonetheless\, even for monotone functions\, using NOT gates can significantly reduce the size of the required circuitry. In this talk\, we explore this mystery and survey known facts.
URL:https://www.ashoka.edu.in/event/the-power-of-negations-in-boolean-circuits/
CATEGORIES:Offline
END:VEVENT
END:VCALENDAR