18 search results - page 3 / 4 » Deterministic identity testing for multivariate polynomials |
COCO
2006
Springer
14 years 11 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...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
67
Voted
COCO
2009
Springer
15 years 4 months 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...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We study the problem of polynomial identity testing (PIT) for depth 2 arithmetic circuits over matrix algebra. We show that identity testing of depth 3 (ΣΠΣ) arithmetic circuit...