Deterministically testing sparse polynomial identities of unbounded degree

Information Processing Letters

Volumn 109, Issue 3, 2009, Pages 187-192

  Bläser, Markus ^a   Hardt, Moritz ^b   Lipton, Richard J ^c   Vishnoi, Nisheeth K ^d  

^a SAARLAND UNIVERSITY   (Germany)

^b PRINCETON UNIVERSITY   (United States)

^c GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^d Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

Arithmetic circuits; Derandomization; Polynomial identity testing; Theory of computation

Indexed keywords

COMPUTATION THEORY; LOGIC CIRCUITS; NUMBER THEORY;

ARITHMETIC CIRCUIT; ARITHMETIC PROGRESSIONS; DERANDOMIZATION; DETERMINISTIC ALGORITHMS; EXPONENTIAL DEPENDENCE; LOGARITHMIC DEPENDENCE; POLYNOMIAL IDENTITY TESTING; THEORY OF COMPUTATION;

POLYNOMIALS;

EID: 57349097682     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2008.09.029     Document Type: Article

References (32)

1. Chari S., Rohatgi P., and Srinivasan A. Randomness-optimal unique element isolation with applications to perfect matching and related problems. SIAM J. Comput. 24 5 (1995) 1036-1050
2. L. Lovász, On determinants, matchings, and random algorithms, in: FCT, 1979, pp. 565-574
3. Mulmuley K., Vazirani U.V., and Vazirani V.V. Matching is as easy as matrix inversion. Combinatorica 7 1 (1987) 105-113
4. Blum M., Chandra A.K., and Wegman M.N. Equivalence of free boolean graphs can be decided probabilistically in polynomial time. Inform. Process. Lett. 10 (1980) 80-82
5. Blum M., and Kannan S. Designing programs that check their work. J. ACM 42 1 (1995) 269-291
6. Agrawal M., and Biswas S. Primality and identity testing via Chinese remaindering. J. ACM 50 4 (2003) 429-443
7. Shamir A. IP = PSPACE. J. ACM 39 4 (1992) 869-877
8. Arora S., and Safra S. Probabilistic checking of proofs: a new characterization of NP. J. ACM 45 1 (1998) 70-122
9. DeMillo R.A., and Lipton R.J. A probabilistic remark on algebraic program testing. Inform. Process. Lett. 7 4 (1978) 193-195
10. Zippel R. Probabilistic algorithms for sparse polynomials. Proc. ISSAC (1979), Springer-Verlag, Berlin 216-226
11. Schwartz J. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27 (1980) 701-717
12. Lewin D., and Vadhan S. Checking polynomial identities over any field: Towards a derandomization?. Proc. 30th STOC (1998), ACM 437-438
13. Ben-Or M. A deterministic algorithm for sparse multivariate polynomial interpolation. Proc. 29th STOC (1988), ACM 301-309
14. Grigoriev D.Y., Karpinski M., and Singer M.F. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM J. Comput. 19 6 (1990) 1059-1063
15. Clausen M., Dress A., Grabmeier J., and Karpinski M. On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields. Theoret. Comput. Sci. 84 2 (1991) 151-164
16. Grigoriev D., Karpinski M., and Singer M.F. Computational complexity of sparse rational interpolation. SIAM J. Comput. 23 1 (1994) 1-12
17. Werther K. The complexity of sparse polynomial interpolation over finite fields. Applicable Algebra in Engineering, Communication and Computing 5 (1994) 91-103
18. Klivans A., and Spielman D.A. Randomness efficient identity testing of multivariate polynomials. Proc. 33th STOC (2001), ACM 216-223
19. Chen Z.-Z., and Kao M.-Y. Reducing randomness via irrational numbers. Proc. 29th STOC (1997), ACM 200-209
20. Bogdanov A. Pseudorandom generators for low degree polynomials. Proc. 37th STOC (2005), ACM 21-30
21. Bläser M., Hardt M., and Steurer D. Asymptotically optimal hitting sets against polynomials. Proc. 35th ICALP (2008), Springer 345-356
22. Karpinski M., and Shparlinski I. On some approximation problems concerning sparse polynomials over finite fields. Theor. Comput. Sci. 157 2 (1996) 259-266
23. Kayal N., and Saxena N. Polynomial identity testing for depth 3 circuits. Proc. 21st CCC (2006), IEEE 9-17
24. Dvir Z., and Shpilka A. Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput. 36 5 (2007) 1404-1434
25. Shpilka A. Interpolation of depth-3 arithmetic circuits with two multiplication gates. Proc. 39th STOC (2007), ACM 284-293
26. Agrawal M. Proving lower bounds via pseudo-random generators. Proc. 25th FSTTCS (2005), Springer 92-105
27. Kabanets V., and Impagliazzo R. Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complex. 13 1/2 (2004) 1-46
28. Linnik U.V. On the least prime in an arithmetic progression. I. The basic theorem. Mat. Sb. (N.S.) 15 57 (1944) 139-178
29. Ribenboim P. The New Book of Prime Number Records (1996), Springer, New York
30. Baker R.C., and Harman G. The Brun-Titchmarsh theorem on average. Analytic Number Theory, vol. 1. Allerton Park, IL, 1995. Progr. Math. vol. 138 (1996), Birkhäuser Boston, Boston, MA 39-103
31. Gathen J.V.Z., and Gerhard J. Modern Computer Algebra (2003), Cambridge University Press, New York, NY, USA
32. Agrawal M., Kayal N., and Saxena N. PRIMES is in P. Ann. of Math. (2) 160 2 (2004) 781-793