Deterministically testing sparse polynomial identities of unbounded degree

We present two deterministic algorithms for the arithmetic circuit identity testing problem. The running time of our algorithms is polynomially bounded in s and m, where s is the size of the circuit and m is an upper bound on the number monomials with non-zero coefficients in its standard representation. The running time of our algorithms also has a logarithmic dependence on the degree of the polynomial but, since a circuit of size s can only compute polynomials of degree at most 2^s, the running time does not depend on its degree. Before this work, all such deterministic algorithms had a polynomial dependence on the degree and therefore an exponential dependence on s. Our first algorithm works over the integers and it requires only black-box access to the given circuit. Though this algorithm is quite simple, the analysis of why it works relies on Linnik's Theorem, a deep result from number theory about the size of the smallest prime in an arithmetic progression. Our second algorithm, unlike the first, uses elementary arguments and works over any integral domains, but it uses the circuit in a less restricted manner. In both cases the running time has a logarithmic dependence on the largest coefficient of the polynomial.

[1]  Marek Karpinski,et al.  Computational Complexity of Sparse Rational Interpolation , 1994, SIAM J. Comput..

[2]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[3]  László Lovász,et al.  On determinants, matchings, and random algorithms , 1979, International Symposium on Fundamentals of Computation Theory.

[4]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[5]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[6]  Manindra Agrawal,et al.  Proving Lower Bounds Via Pseudo-random Generators , 2005, FSTTCS.

[7]  Zeev Dvir,et al.  Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits , 2007, SIAM J. Comput..

[8]  Manuel Blum,et al.  Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..

[9]  Amir Shpilka.  Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates , 2009, SIAM J. Comput..

[10]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[11]  Aravind Srinivasan,et al.  Randomness-optimal unique element isolation, with applications to perfect matching and related problems , 1993, STOC '93.

[12]  Russell Impagliazzo,et al.  Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds , 2003, STOC '03.

[13]  Aravind Srinivasan,et al.  Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems , 1995, SIAM J. Comput..

[14]  Zhi-Zhong Chen,et al.  Reducing randomness via irrational numbers , 1997, STOC '97.

[15]  Roger C. Baker,et al.  The Brun-Titchmarsh Theorem on average , 1996 .

[16]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[17]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[18]  Kai Werther,et al.  The complexity of sparse polynomial interpolation over finite fields , 1994, Applicable Algebra in Engineering, Communication and Computing.

[19]  Manindra Agrawal,et al.  Primality and identity testing via Chinese remaindering , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[20]  Richard Zippel,et al.  Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[21]  Andrej Bogdanov.  Pseudorandom generators for low degree polynomials , 2005, STOC '05.

[22]  P. Ribenboim.  The new book of prime number records , 1996 .

[23]  Nisheeth K. Vishnoi,et al.  Deterministic identity testing for multivariate polynomials , 2003, SODA '03.

[24]  Richard J. Lipton,et al.  A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..

[25]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[26]  Daniel A. Spielman,et al.  Randomness efficient identity testing of multivariate polynomials , 2001, STOC '01.

[27]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[28]  Salil P. Vadhan,et al.  Checking polynomial identities over any field: towards a derandomization? , 1998, STOC '98.

[29]  Marek Karpinski,et al.  Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields , 1988, SIAM J. Comput..

[30]  Michael Ben-Or,et al.  A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[31]  Marek Karpinski,et al.  On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields , 1996, Theor. Comput. Sci..

[32]  Marek Karpinski,et al.  On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields , 1991, Theor. Comput. Sci..

[33]  Neeraj Kayal,et al.  Polynomial Identity Testing for Depth 3 Circuits , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[34]  Markus Bläser,et al.  Asymptotically Optimal Hitting Sets Against Polynomials , 2008, ICALP.

[35]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[36]  Wang Wei.  On the least prime in an arithmetic progression , 1991 .