38 search results - page 3 / 8 » Read-Once Polynomial Identity Testing |
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
STOC
2003
ACM
14 years 1 months ago
2003
ACM
