Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, October 28, 2022 1:00 pm - 2:00 pm EDT (GMT -04:00)

Seminar • Algorithms and Complexity • New Lower Bounds for Set Multilinear Formulas

Please note: This seminar will take place in DC 1304 and online.

Shubhangi Saraf, Associate Professor
Department of Mathematics, Department of Computer Science, University of Toronto

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.