Suryajith Chillara (University of Haifa)
Wednesday, 28.10.2020, 12:30
Zoom, Meeting ID: 954 7347 4134, Password: 5-digit Technion Zip Code
The complexity of Iterated Matrix Multiplication is a central theme in Computational Complexity theory, as the problem is closely related to the problem of separating various complexity classes within P. In this talk, we will talk about the complexity of computing an entry in the product of d many nÃn generic matrices (denoted IMMn,d) by depth four circuits of bounded individual degree.
We show that for all r â¤ na for a fixed constant a, any âsyntacticâ depth four circuit of bounded individual degree r computing IMMn,d must have size ní µí»º(âd) when d â¤ nb (for a fixed constant b â¤ a). This improves upon a previous result of Kayal, Saha and Tavenas [STOC 2016 & Theory of Computing, 2018] who proved a lower bound of (n/r1.1)í µí»º(âd/r) for the same.
This talk assumes no relevant background. We will introduce the model of computation, the motivation to study computation of multilinear polynomials by circuits of bounded individual degree and briefly survey relevant results to this restricted model of computation.