2 search results - page 1 / 1 » Reconstruction of Generalized Depth-3 Arithmetic Circuits wi... |
COCO
2009
Springer
14 years 5 months 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 ...
ECCC
2011
13 years 5 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...