AC Seminar: Shubhangi Saraf Unveils New Lower Bounds for Set Multilinear Forms π
Join us for an insightful seminar with Shubhangi Saraf exploring groundbreaking results on superpolynomial lower bounds in algebraic circuit complexity, based on recent advances by Limaye, Srinivasan, and Tavenas.

U Waterloo A&C Seminar
68 views β’ Nov 7, 2022

About this video
The recent exciting breakthrough by Limaye, Srinivasan, and Tavenas showing superpolynomial lower bounds
for constant-depth algebraic circuits has underscored the importance of studying the complexity of set multilinear formulas.
In this talk, along with discussing the impact of this work and several others in the literature, I will discuss
some new results in this area, namely strong (and βsharpβ) lower bounds for set-multilinear circuits/formulas in the
constant (or low) depth setting.
This is based on joint work with Deepanshu Kush.
for constant-depth algebraic circuits has underscored the importance of studying the complexity of set multilinear formulas.
In this talk, along with discussing the impact of this work and several others in the literature, I will discuss
some new results in this area, namely strong (and βsharpβ) lower bounds for set-multilinear circuits/formulas in the
constant (or low) depth setting.
This is based on joint work with Deepanshu Kush.
Video Information
Views
68
Duration
53:14
Published
Nov 7, 2022
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.