The first talk by the speaker is here.
We will discuss a short and self contained proof (based on joint work with Chi-Ning Chou and Noam Solomon) of a classical result of Kaltofen from the mid 1980s where he showed that if an n-variate degree-d polynomial f can be computed by an arithmetic circuit of size s, then each of its factors can be computed by an arithmetic circuit of size at most poly(s,n,d).
This video was produced by the International Centre for Physical Sciences, forming part of the Workshop on Algebraic Complexity Theory.
