35 search results - page 3 / 7 » Polynomial Identity Testing for Depth 3 Circuits |
COCO
2009
Springer
14 years 6 days ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
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...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
COCO
2009
Springer
14 years 6 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 ...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...