Advertisement

Depth-4 Identity Testing and Noether’s Normalization Lemma

  • Partha MukhopadhyayEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9691)

Abstract

We consider the black-box polynomial identity testing (\({\small \mathrm {PIT}}\)) problem for a sub-class of depth-4 \(\varSigma \varPi \varSigma \varPi (k,r)\) circuits. Such circuits compute polynomials of the following type: \( C({\small \mathrm X}) = \sum _{i=1}^k \prod _{j=1}^{d_i} Q_{i,j}, \) where k is the fan-in of the top \(\varSigma \) gate and r is the maximum degree of the polynomials \(\{Q_{i,j}\}_{i\in [k], j\in [d_i]}\), and \(k,r=O(1)\). We consider a sub-class of such circuits satisfying a generic algebraic-geometric restriction, and we give a deterministic polynomial-time black-box \({\small \mathrm {PIT}}\) algorithm for such circuits.

Our study is motivated by two recent results of Mulmuley (FOCS 2012, [Mul12]), and Gupta (ECCC 2014, [Gup14]). In particular, we obtain the derandomization by solving a particular instance of derandomization problem of Noether’s Normalization Lemma (\(\mathrm{NNL}\)). Our result can also be considered as a unified way of viewing the depth-4 \({\small \mathrm {PIT}}\) problems closely related to the work of Gupta [Gup14], and the approach suggested by Mulmuley [Mul12].

Notes

Acknowledgement

I thank K.V. Subrahmanyam for many helpful discussions.

References

  1. [Agr05]
    Agrawal, M.: Proving lower bounds via pseudo-random generators. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 92–105. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. [AKS04]
    Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math. 160(2), 781–793 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  3. [ALM+98]
    Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501–555 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  4. [Alo99]
    Alon, N.: Combinatorial Nullstellensatz. Comb. Probab. Comput. 8, 7–30 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  5. [AM10]
    Arvind, V., Mukhopadhyay, P.: The ideal membership problem and polynomial identity testing. Inf. Comput. 208(4), 351–363 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  6. [ASSS12]
    Agrawal, M., Saha, C., Saptharishi, R., Saxena, N.: Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, pp. 599–614 (2012)Google Scholar
  7. [AV08]
    Agrawal, M., Vinay, V.: Arithmetic circuits: a chasm at depth four. In: Proceedings-Annual Symposium on Foundations of Computer Science, pp. 67–75. IEEE (2008)Google Scholar
  8. [BMS13]
    Beecken, M., Mittmann, J., Saxena, N.: Algebraic independence and blackbox identity testing. Inf. Comput. 222, 2–19 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  9. [CLO05]
    Cox, D.A., Little, J., O’Shea, D.: Using Algebraic Geometry. Springer, New York (2005)zbMATHGoogle Scholar
  10. [CLO07]
    Cox, D.A., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra. 3/e (Undergraduate Texts in Mathematics). Springer, New York (2007)CrossRefzbMATHGoogle Scholar
  11. [DS07]
    Dvir, Z., Shpilka, A.: Locally decodable codes with two queries and polynomial identity testing for depth 3 circuits. SIAM J. Comput. 36(5), 1404–1434 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  12. [FS13a]
    Forbes, M.A., Shpilka, A.: Explicit Noether normalization for simultaneous conjugation via polynomial identity testing. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) RANDOM 2013 and APPROX 2013. LNCS, vol. 8096, pp. 527–542. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  13. [FS13b]
    Forbes, M.A., Shpilka, A.: Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, pp. 243–252 (2013)Google Scholar
  14. [GKKS13a]
    Gupta, A., Kamath, P., Kayal, N., Saptharishi, R.: Approaching the chasm at depth four. In: IEEE Conference on Computational Complexity, pp. 65–73 (2013)Google Scholar
  15. [GKKS13b]
    Gupta, A., Kamath, P., Kayal, N., Saptharishi, R.: Arithmetic circuits: a chasm at depth three. In: FOCS, pp. 578–587 (2013)Google Scholar
  16. [Gup14]
    Gupta, A.: Algebraic geometric techniques for depth-4 PIT & Sylvester-Gallai conjectures for varieties. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 21, p. 130 (2014)Google Scholar
  17. [HS80]
    Heintz, J., Schnorr, C.-P.: Testing polynomials which are easy to compute (extended abstract). In: Proceedings of the 12th Annual ACM Symposium on Theory of Computing, pp. 262–272 (1980)Google Scholar
  18. [KI04]
    Kabanets, V., Impagliazzo, R.: Derandomizing polynomial identity tests means proving circuit lower bounds. Comput. Complex. 13(1–2), 1–46 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  19. [KMSV13]
    Karnin, Z.S., Mukhopadhyay, P., Shpilka, A., Volkovich, I.: Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. SIAM J. Comput. 42(6), 2114–2131 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  20. [KS01]
    Klivans, A., Spielman, D.A.: Randomness efficient identity testing of multivariate polynomials. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 6–8 July 2001, pp. 216–223 (2001)Google Scholar
  21. [KS07]
    Kayal, N., Saxena, N.: Polynomial identity testing for depth 3 circuits. Comput. Complex. 16(2), 115–138 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  22. [KS09]
    Kayal, N., Saraf, S.: Blackbox polynomial identity testing for depth 3 circuits. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, pp. 198–207 (2009)Google Scholar
  23. [KS11]
    Karnin, Z.S., Shpilka, A.: Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. Combinatorica 31(3), 333–364 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  24. [Lov79]
    Lovász, L.: On determinants, matchings, and random algorithms. In: FCT, pp. 565–574 (1979)Google Scholar
  25. [Mul12]
    Mulmuley, K.: Geometric complexity theory V: equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether’s Normalization Lemma. In: CoRR (also, in FOCS 2012) (2012). abs/1209.5993Google Scholar
  26. [Mum76]
    Mumford, D.: Algebraic Geometry I : Complex Projective Varieties. Springer, Heidelberg (1976). Grundlehren der mathematischen WissenschaftenzbMATHGoogle Scholar
  27. [MVV87]
    Mulmuley, K., Vazirani, U.V., Vazirani, V.V.: Matching is as easy as matrix inversion. Combinatorica 7(1), 105–113 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  28. [Sch80]
    Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701–717 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  29. [Sha90]
    Shamir, A.: IP=PSPACE. In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, 22–24 October 1990, vol. 1, pp. 11–15 (1990)Google Scholar
  30. [SS12]
    Saxena, N., Seshadhri, C.: Blackbox identity testing for bounded top-fanin depth-3 circuits: the field doesn’t matter. SIAM J. Comput. 41(5), 1285–1298 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  31. [SV11]
    Saraf, S., Volkovich, I.: Black-box identity testing of depth-4 multilinear circuits. In: Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, pp. 421–430 (2011)Google Scholar
  32. [SY10]
    Shpilka, A., Yehudayoff, A.: Arithmetic circuits: a survey of recent results and open questions. Found. Trends Theoret. Comput. Sci. 5(3–4), 207–388 (2010)MathSciNetzbMATHGoogle Scholar
  33. [Zip79]
    Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Symbolic and Algebraic Computation, EUROSAM 1979, An International Symposiumon Symbolic and Algebraic Computation, pp. 216–226 (1979)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Chennai Mathematical InstituteChennaiIndia

Personalised recommendations