BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20251026T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20261025T030000
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20260329T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.30665.field_data.0@www.diag.uniroma1.it
DTSTAMP:20260413T063039Z
CREATED:20260412T084422Z
DESCRIPTION:Abstract: Valiant's seminal work in 1976 showed that depth-3 ci
 rcuits non-trivially capture unrestricted computation. In particular stron
 g exponential lower bounds for depth-3 circuits imply non-linear lower bou
 nds for (almost) general circuits\, a frontier in complexity theory. Howev
 er\, the state-of-the-art lower bounds have not changed since the 80s. In 
 the past few years\, we have developed a new program and techniques to mak
 e progress in this front. In this talk I will outline these results.Bio sk
 etch: Navid Talebanfard from Univeristy of Sheffield will be host in the d
 epartment from April 16th  to April 21th. He will give a talk Friday April
  17 in Room A4 at 11:30 (right after the teaching meeting) about his recen
 t results obtained with Mohan Paturi\, Mike Sacks\, Daniel Kleber and Chir
 s Rosin about optimal depth three boolean circuits and new lower bounds te
 chniques for boolean circuits. 
DTSTART;TZID=Europe/Paris:20260417T113000
DTEND;TZID=Europe/Paris:20260417T113000
LAST-MODIFIED:20260412T090549Z
LOCATION:Aula A4
SUMMARY:Seminar: Depth-Three Circuits: Recent Constructions and Lower Bound
 s\, and the Road Ahead  - Navid Talebanfard (University of Sheffield)
URL;TYPE=URI:https://www.diag.uniroma1.it/node/30665
END:VEVENT
END:VCALENDAR