New Exponential Size Lower Bounds against Depth Four Circuits of Bounded Individual Degree

Suryajith Chillara

Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\ge \omega (\log n)$, any syntactic depth four circuit of bounded…