11 search results - page 1 / 3 » On Derandomizing Tests for Certain Polynomial Identities |
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.
STOC
2003
ACM
13 years 10 months ago
2003
ACM
ECCC
2010
13 years 2 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...
STOC
1998
ACM
13 years 9 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) ...