18 search results - page 2 / 4 » Deterministic identity testing for multivariate polynomials |
ICALP
2010
Springer
13 years 11 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...
DAGSTUHL
2007
13 years 8 months ago
2007
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
ECCC
2010
13 years 5 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...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
APPROX
2009
Springer
14 years 1 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...