21 search results - page 1 / 5 » Bounded Depth Arithmetic Circuits: Counting and Closure |
ICALP
1999
Springer
13 years 10 months ago
1999
Springer
FOCS
2008
IEEE
14 years 2 days ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...
COCO
2009
Springer
14 years 5 days ago
2009
Springer
In this paper we give reconstruction algorithms for depth-3 arithmetic circuits with k multiplication gates (also known as ΣΠΣ(k) circuits), where k = O(1). Namely, we give an ...
CORR
2002
Springer
13 years 5 months ago
2002
Springer
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...
COCO
2008
Springer
13 years 7 months ago
2008
Springer
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...