18 search results - page 1 / 4 » Deterministic identity testing for multivariate polynomials |
SODA
2003
ACM
13 years 5 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 + ...
ECCC
2011
12 years 11 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases:
CORR
2010
Springer
13 years 4 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 ...
STOC
2005
ACM
14 years 4 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...