15 search results - page 1 / 3 » Improved Polynomial Identity Testing for Read-Once Formulas |
APPROX
2009
Springer
13 years 11 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...
ECCC
2010
13 years 4 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 {+,
ECCC
2010
13 years 3 months ago
2010
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...
ECCC
2010
13 years 1 months ago
2010
ICALP
2010
Springer
13 years 9 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...