BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:2f5c5a31-c549-4067-a090-ef6d7ae2036b
X-WR-CALNAME:GT LX - Sébastien Tavenas - Superpolynomial lower bounds again
 st low-depth algebraic circuits
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20251026T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20221030T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20231029T030000
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:2f5c5a31-c549-4067-a090-ef6d7ae2036b
DTSTAMP:20260510T232230Z
CLASS:PUBLIC
DESCRIPTION:An algebraic circuit computes a polynomial using addition and m
 ultiplication operators. Understanding the power of algebraic circuits has
  close connections to understanding general computation. Despite this\, no
 t many lower bounds are known for even simple Sigma Pi Sigma (product-dept
 h 1) circuits. Before our work\, the best known lower bound for product-de
 pth 1 circuit was (slightly less than) cubic. No lower bounds were known f
 or general product-depth 2 circuits.\n\nIn this work\, we show the first s
 uperpolynomial lower bound for low-product-depth algebraic circuits.\nIn t
 he talk\, we discuss the main results and present the proof ideas used in 
 the proof of the superpolynomial lower bound for product-depth 1 circuits.
 \n\nThis talk is based on joint work with Nutan Limaye and Srikanth Sriniv
 asan.
DTSTART;TZID=Europe/Paris:20231005T130000
DTEND;TZID=Europe/Paris:20231005T140000
LOCATION:salle 178 & https://u-bordeaux-fr.zoom.us/j/83965459705
SEQUENCE:0
SUMMARY:GT LX - Sébastien Tavenas - Superpolynomial lower bounds against lo
 w-depth algebraic circuits
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
