Document Open Access Logo

Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing

Authors Mrinal Kumar, Shubhangi Saraf

PDF
Thumbnail PDF

File

LIPIcs.CCC.2016.35.pdf
  • Filesize: 0.65 MB
  • 29 pages

Document Identifiers

Author Details

Mrinal Kumar
Shubhangi Saraf

Cite AsGet BibTex

Mrinal Kumar and Shubhangi Saraf. Sums of Products of Polynomials in Few Variables: Lower Bounds and Polynomial Identity Testing. In 31st Conference on Computational Complexity (CCC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 50, pp. 35:1-35:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.CCC.2016.35

Abstract

We study the complexity of representing polynomials as a sum of products of polynomials in few variables. More precisely, we study representations of the form P = sum_{i=1}^T prod_{j=1}^d Q_{ij} such that each Q_{ij} is an arbitrary polynomial that depends on at most s variables. We prove the following results. 1. Over fields of characteristic zero, for every constant mu such that 0<=mu<=1, we give an explicit family of polynomials {P_{N}}, where P_{N} is of degree n in N = n^{O(1)} variables, such that any representation of the above type for P_{N} with s = N^{mu} requires Td >= n^{Omega(sqrt(n))}. This strengthens a recent result of Kayal and Saha [Kayal/Saha, ECCC 2014] which showed similar lower bounds for the model of sums of products of linear forms in few variables. It is known that any asymptotic improvement in the exponent of the lower bounds (even for s=sqrt(n)) would separate VP and VNP [Kayal/Saha, ECCC 2014]. 2. We obtain a deterministic subexponential time blackbox polynomial identity testing (PIT) algorithm for circuits computed by the above model when T and the individual degree of each variable in P are at most log^{O(1)}(N) and s<=N^{mu} for any constant mu<1/2. We get quasipolynomial running time when s<log^{O(1)}(N). The PIT algorithm is obtained by combining our lower bounds with the hardness-randomness tradeoffs developed in [Dvir/Shpilka/Yehudayoff, SIAM J. Comp. 2009; Kabanets/Impagliazzo, Comp. Compl. 2004]. To the best of our knowledge, this is the first nontrivial PIT algorithm for this model (even for the case s=2), and the first nontrivial PIT algorithm obtained from lower bounds for small depth circuits.
Keywords
  • arithmetic circuits
  • lower bounds
  • polynomial identity testing
  • hardness vs randomness

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. M. Agrawal and V. Vinay. Arithmetic circuits: A chasm at depth four. In FOCS, 2008. Google Scholar
  2. Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, and Nitin Saxena. Jacobian hits circuits: hitting-sets, lower bounds for depth-d occur-k formulas & depth-3 transcendence degree-k circuits. In Proceedings of the 44th ACM symposium on Theory of computing, pages 599-614, 2012. Google Scholar
  3. Manindra Agrawal, Chandan Saha, and Nitin Saxena. Quasi-polynomial hitting-set for set-depth-Δ formulas. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC'13, pages 321-330, New York, NY, USA, 2013. ACM. URL: http://dx.doi.org/10.1145/2488608.2488649.
  4. Noga Alon. Combinatorial nullstellensatz. Combinatorics, Probability and Computing, 8, 1999. Google Scholar
  5. Rafael Mendes de Oliveira, Amir Shpilka, and Ben Lee Volk. Subexponential size hitting sets for bounded depth multilinear formulas. Electronic Colloquium on Computational Complexity (ECCC), 21:157, 2014. Google Scholar
  6. Zeev Dvir, Amir Shpilka, and Amir Yehudayoff. Hardness-randomness tradeoffs for bounded depth arithmetic circuits. SIAM J. Comput., 39(4):1279-1293, 2009. URL: http://dx.doi.org/10.1137/080735850.
  7. Michael Forbes. Deterministic divisibility testing via shifted partial derivatives. In FOCS, 2015. Google Scholar
  8. Michael A. Forbes and Amir Shpilka. On identity testing of tensors, low-rank recovery and compressed sensing. In Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19-22, 2012, pages 163-172, 2012. Google Scholar
  9. Michael A. Forbes and Amir Shpilka. Quasipolynomial-time identity testing of non-commutative and read-once oblivious algebraic branching programs. 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 0:243-252, 2013. Google Scholar
  10. H. Fournier, N. Limaye, G. Malod, and S. Srinivasan. Lower bounds for depth 4 formulas computing iterated matrix multiplication. In STOC, 2014. Google Scholar
  11. A. Gupta, P. Kamath, N. Kayal, and R. Saptharishi. Approaching the chasm at depth four. In CCC, 2013. Google Scholar
  12. Ankit Gupta. Algebraic geometric techniques for depth-4 PIT & sylvester-gallai conjectures for varieties. Electronic Colloquium on Computational Complexity (ECCC), 21:130, 2014. URL: http://eccc.hpi-web.de/report/2014/130.
  13. Ankit Gupta, Pritish Kamath, Neeraj Kayal, and Ramprasad Saptharishi. Arithmetic circuits: A chasm at depth three. In FOCS, 2013. Google Scholar
  14. V. Kabanets and R. Impagliazzo. Derandomizing polynomial identity tests means proving circuit lower bounds. Computational Complexity, 13(1-2):1-46, 2004. Google Scholar
  15. N. Kayal, N. Limaye, C. Saha, and S. Srinivasan. An exponential lower bound for homogeneous depth four arithmetic formulas. In FOCS, 2014. Google Scholar
  16. Neeraj Kayal. An exponential lower bound for the sum of powers of bounded degree polynomials. ECCC, 19:81, 2012. URL: http://eccc.hpi-web.de/report/2012/081.
  17. Neeraj Kayal and Chandan Saha. Lower bounds for depth three arithmetic circuits with small bottom fanin. Electronic Colloquium on Computational Complexity (ECCC), 21:89, 2014. URL: http://eccc.hpi-web.de/report/2014/089.
  18. Neeraj Kayal and Chandan Saha. Lower bounds for sums of products of low arity polynomials. Electronic Colloquium on Computational Complexity (ECCC), 2014. Google Scholar
  19. Neeraj Kayal, Chandan Saha, and Ramprasad Saptharishi. A super-polynomial lower bound for regular arithmetic formulas. In STOC, 2014. Google Scholar
  20. P. Koiran. Arithmetic circuits : The chasm at depth four gets wider. TCS, 2012. Google Scholar
  21. Mrinal Kumar and Shubhangi Saraf. The limits of depth reduction for arithmetic formulas: It’s all about the top fan-in. In STOC, 2014. Google Scholar
  22. Mrinal Kumar and Shubhangi Saraf. On the power of homogeneous depth 4 arithmetic circuits. FOCS, 2014. Google Scholar
  23. Partha Mukhopadhyay. Depth-4 identity testing and noether’s normalization lemma. Electronic Colloquium on Computational Complexity (ECCC), 2015. Google Scholar
  24. Noam Nisan. Lower bounds for non-commutative computation (extended abstract). In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA, pages 410-418, 1991. Google Scholar
  25. Noam Nisan and Avi Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49(2):149-167, 1994. Google Scholar
  26. Noam Nisan and Avi Wigderson. Hardness vs randomness. J. Comput. Syst. Sci., 49(2):149-167, 1994. URL: http://dx.doi.org/10.1016/S0022-0000(05)80043-1.
  27. Ran Raz. Separation of multilinear circuit and formula size. Theory of Computing, 2(1):121-135, 2006. URL: http://dx.doi.org/10.4086/toc.2006.v002a006.
  28. S. Saraf and I. Volkovich. Black-box identity testing of depth-4 multilinear circuits. In Proceedings of the 43rd Annual STOC, pages 421-430, 2011. Google Scholar
  29. Nitin Saxena. Diagonal circuit identity testing and lower bounds. Electronic Colloquium on Computational Complexity (ECCC), 14(124), 2007. Google Scholar
  30. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of ACM, 27(4):701-717, 1980. Google Scholar
  31. A. Shpilka and A. Wigderson. Depth-3 arithmetic circuits over fields of characteristic zero. Computational Complexity, 10(1):1-27, 2001. Google Scholar
  32. Amir Shpilka. Affine projections of symmetric polynomials. In Proceedings of the 16th Annual Conference on Computational Complexity, CCC'01, pages 160-, Washington, DC, USA, 2001. IEEE Computer Society. Google Scholar
  33. Sébastien Tavenas. Improved bounds for reduction to depth 4 and depth 3. In MFCS, pages 813-824, 2013. URL: http://dx.doi.org/10.1007/978-3-642-40313-2_71.
  34. L. G. Valiant. Completeness classes in algebra. In STOC, 1979. Google Scholar
  35. Leslie G. Valiant, Sven Skyum, S. Berkowitz, and Charles Rackoff. Fast parallel computation of polynomials using few processors. SIAM Journal of Computation, 12(4):641-644, 1983. URL: http://dx.doi.org/10.1137/0212043.
  36. R. Zippel. Probabilistic algorithms for sparse polynomials. Symbolic and algebraic computation, pages 216-226, 1979. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact