Browsing Computer Science and Automation (CSA) by Subject "Algebraic Complexity Theory"
Now showing items 1-1 of 1
-
On Orbits and Border of Constant Read Circuits and Lower Bounds for Constant Depth Circuits
Two of the most common ways in which arithmetic circuits can be restricted is by requiring that they be constant read or constant depth. Constant depth circuits have received a lot of attention in the arithmetic circuit ...