35 search results - page 4 / 7 » Polynomial Identity Testing for Depth 3 Circuits |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In this paper we consider the problem of constructing a small arithmetic circuit for a polynomial for which we have oracle access. Our focus is on n-variate polynomials, over a fi...
STOC
2003
ACM
14 years 1 months ago
2003
ACM
ECCC
2010
13 years 8 months ago
2010
An arithmetic read-once formula (ROF for short) is a formula (a circuit in which the fanout of every gate is at most 1) in which the operations are {+,
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...