BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1713
DTSTAMP:20260505T050626Z
SUMMARY:Deterministic Algorithms for Factors of Constant-Depth Arithmetic C
 ircuits
DESCRIPTION:Speaker: Varun Ramanathan (TIFR)\n\nAbstract: \nMultivariate po
 lynomial factorization is a fundamental algebraic problem with connections
  to error-correcting codes\, pseudorandomness and complexity theory. Const
 ant-depth circuits are a natural way to capture algebraic computation tha
 t is highly parallelizable. In this talk\, we will try and understand some
  of the ideas that went into a recent line of work that concluded with a d
 eterministic factorization algorithm for constant-depth circuits. More gen
 erally\, we will see that for most natural algebraic models\, deterministi
 c (black-box) polynomial identity testing is sufficient for deterministic 
 factorization.At the heart of these algorithmic results\, we will use poly
 nomial identity testing to project multivariate polynomials to univariate 
 polynomials while preserving information about the factors. The final algo
 rithmic result in this line of work builds upon a recent surprising and im
 portant structural result: constant-depth circuits (and most natural algeb
 raic models) are closed under factoring -- if a polynomial has a constant-
 depth circuit\, then so do its factors.  This talk will be based on colla
 borations with Somnath Bhattacharjee\, Mrinal Kumar\, Shanthanu Suresh Rai
 \, Ramprasad Saptharishi\, Shubhangi Saraf and Ben Lee Volk.\n
URL:https://www.tcs.tifr.res.in/web/events/1713
DTSTART;TZID=Asia/Kolkata:20260507T163000
DTEND;TZID=Asia/Kolkata:20260507T173000
LOCATION:A-201 and Zoom
END:VEVENT
END:VCALENDAR