Abstract
The 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 cases of identity testing—first is a case of depth-3 PIT, the other of depth-4 PIT.
Our first problem is a vast generalization of verifying whether a bounded top fan-in depth-3 circuit equals a sparse polynomial (given as a sum of monomial terms). Formally, given a depth-3 circuit C, having constant many general product gates and arbitrarily many semidiagonal product gates test whether the output of C is identically zero. A semidiagonal product gate in C computes a product of the form \({m \cdot \prod^b_{i=1}l^{e_i}_i}\), where m is a monomial, l i is a linear polynomial, and b is a constant. We give a deterministic polynomial time test, along with the computation of leading monomials of semidiagonal circuits over local rings.
The second problem is on verifying a given sparse polynomial factorization, which is a classical question (von zur Gathen, FOCS 1983): Given multivariate sparse polynomials f, g1, . . . , gt explicitly check whether \({f = \prod^t_{i=1} {g_i}}\). For the special case when every gi is a sum of univariate polynomials, we give a deterministic polynomial time test. We characterize the factors of such g i ’s and even show how to test the divisibility of f by the powers of such polynomials.
The common tools used are Chinese remaindering and dual representation. The dual representation of polynomials (Saxena, ICALP 2008) is a technique to express a product-of-sums of univariates as a sum-ofproducts of univariates. We generalize this technique by combining it with a generalized Chinese remaindering to solve these two problems (over any field).
Similar content being viewed by others
References
Manindra Agrawal (2005). Proving Lower Bounds Via Pseudorandom Generators. In Foundations of Software Technology and Theoretical Computer Science, 92–105.
Manindra Agrawal & Somenath Biswas (1999). Primality and Identity Testing via Chinese Remaindering. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York City NY 202–209.
Manindra Agrawal, Neeraj Kayal, Nitin Saxena (2004) PRIMES is in P. Annals of Mathematics 160(2): 781–793
Manindra Agrawal & Ramprasad Saptharishi (2009). Classifying polynomials and identity testing. Current Trends in Science, Indian Academy of Sciences 149–162.
Manindra Agrawal & V Vinay (2008). Arithmetic circuits: A chasm at depth four. Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, Philadelphia PA 67–75.
Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy (1998) Proof Verification and the Hardness of Approximation Problems. Journal of the ACM 45(3): 501–555
Zhi-Zhong Chen & Ming-Yang Kao (1997). Reducing Randomness via Irrational Numbers. Proceedings of the Twenty-ninth Annual ACM Symposium on Theory of Computing, El Paso TX 200–209.
Michael Clausen, Andreas W.M. Dress, Johannes Grabmeier, Marek Karpinski (1991) On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields. Theoretical Computer Science 84(2): 151–164
Joachim von zur Gathen (1983). Factoring Sparse Multivariate Polynomials. Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson AZ 172–179.
Valentine Kabanets & Russell Impagliazzo (2003). Derandomizing polynomial identity tests means proving circuit lower bounds. Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, San Diego CA 355–364.
Neeraj Kayal, Nitin Saxena (2007) Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2): 115–138
Adam Klivans & Daniel A. Spielman (2001). Randomness efficient identity testing of multivariate polynomials. Proceedings of the Thirty third Annual ACM Symposium on Theory of Computing, Hersonissos, Crete, Greece 216–223.
Pascal Koiran & Sylvain Perifel (2007). The complexity of two problems on arithmetic circuits. Theoretical Computer Science 389(1-2), 172–181.
Daniel Lewin & Salil P. Vadhan (1998). Checking Polynomial Identities over any Field: Towards a Derandomization? Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, Dallas TX 438–447.
László Lovaśz (1979). On determinants, matchings, and random algorithms. In Fundamentals of Computation Theory, 565–574.
Carsten Lund, Lance Fortnow, Howard J. Karloff & Noam Nisan (1990). Algebraic Methods for Interactive Proof Systems. Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis MO 2–10.
Ran Raz (2010). Tensor-rank and lower bounds for arithmetic formulas. In Proceedings of the Fourty-second Annual ACM Symposium on Theory of Computing, Cambridge, MA, USA, 659–666.
Ran Raz & Amir Shpilka (2004). Deterministic Polynomial Identity Testing in Non-Commutative Models. Proceedings of the 19th IEEE Conference on Computational Complexity, Amherst MA 215–222.
Shubhangi Saraf & Ilya Volkovich (2011). Black-box identity testing of depth-4 multilinear circuits. Proceedings of the Fourty-third Annual ACM Symposium on Theory of Computing, San Jose CA.
Nitin Saxena (2008). Diagonal Circuit Identity Testing and Lower Bounds. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming ICALP, Reykjavik Iceland, 927 60–71.
Nitin Saxena: Progress on Polynomial Identity Testing. Bulletin of the European Association for Theoretical Computer Science 90, 49–79 (2009)
Nitin Saxena & C. Seshadhri (2011). Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn’t matter. Proceedings of the Fourty-third Annual ACM Symposium on Theory of Computing, San Jose CA.
Jacob T. Schwartz (1980) Fast Probabilistic Algorithms for Verification of Polynomial Identities. Journal of the ACM 27(4): 701–717
Adi Shamir (1990). IP=PSPACE. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, St. Louis MO, 939 11–15.
Amir Shpilka, Amir Yehudayoff (2010) Arithmetic Circuits: A survey of recent results and open questions. Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science 5(3-4): 207–388
Richard Zippel (1979). Probabilistic algorithms for sparse polynomials. EUROSAM 216–226.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Saha, C., Saptharishi, R. & Saxena, N. A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. comput. complex. 22, 39–69 (2013). https://doi.org/10.1007/s00037-012-0054-4
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00037-012-0054-4