Browsing Computer Science and Automation (CSA) by Subject "Nisan-Wigderson Polynomials"
Now showing items 1-1 of 1
-
An Improved Lower Bound for Depth four Arithmetic Circuits
(2018-05-29)We study the problem of proving lower bounds for depth four arithmetic circuits. Depth four circuits have been receiving much attraction when it comes to recent circuit lower bound results, as a result of the series of ...