skip to main content
research-article

On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits

Published:18 July 2021Publication History
Skip Abstract Section

Abstract

In this article, we are interested in understanding the complexity of computing multilinear polynomials using depth four circuits in which the polynomial computed at every node has a bound on the individual degree of r≥ 1 with respect to all its variables (referred to as multi-r-ic circuits). The goal of this study is to make progress towards proving superpolynomial lower bounds for general depth four circuits computing multilinear polynomials, by proving better bounds as the value of r increases.

Recently, Kayal, Saha and Tavenas (Theory of Computing, 2018) showed that any depth four arithmetic circuit of bounded individual degree r computing an explicit multilinear polynomial on nO(1) variables and degree d must have size at least (n/r1.1)Ω(√d/r). This bound, however, deteriorates as the value of r increases. It is a natural question to ask if we can prove a bound that does not deteriorate as the value of r increases, or a bound that holds for a larger regime of r.

In this article, we prove a lower bound that does not deteriorate with increasing values of r, albeit for a specific instance of d = d(n) but for a wider range of r. Formally, for all large enough integers n and a small constant η, we show that there exists an explicit polynomial on nO(1) variables and degree Θ (log2 n) such that any depth four circuit of bounded individual degree rnη must have size at least exp(Ω(log2 n)). This improvement is obtained by suitably adapting the complexity measure of Kayal et al. (Theory of Computing, 2018). This adaptation of the measure is inspired by the complexity measure used by Kayal et al. (SIAM J. Computing, 2017).

References

  1. Manindra Agrawal and V. Vinay. 2008. Arithmetic circuits: A chasm at depth four. In Proceedings of Foundations of Computer Science (FOCS’08). 67–75. DOI:https://doi.org/10.1109/FOCS.2008.32Google ScholarGoogle Scholar
  2. Noga Alon, Mrinal Kumar, and Ben Lee Volk. 2018. Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits. In CCC (LIPIcs), Vol. 102. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 11:1–11:16.Google ScholarGoogle Scholar
  3. Walter Baur and Volker Strassen. 1983. The complexity of partial derivatives. Theor. Comput. Sci. 22 (1983), 317–330. https://doi.org/10.1016/0304-3975(83)90110-XGoogle ScholarGoogle ScholarCross RefCross Ref
  4. Suryajith Chillara, Christian Engels, Nutan Limaye, and Srikanth Srinivasan. 2018a. A near-optimal depth-hierarchy theorem for small-depth multilinear circuits. In 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018, Paris, France, October 7-9, 2018, Mikkel Thorup (Ed.). IEEE Computer Society, 934–945. https://doi.org/10.1109/FOCS.2018.00092Google ScholarGoogle ScholarCross RefCross Ref
  5. Suryajith Chillara, Nutan Limaye, and Srikanth Srinivasan. 2018b. A quadratic size-hierarchy theorem for small-depth multilinear formulas. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic (LIPIcs, Vol. 107), Ioannis Chatzigiannakis, Christos Kaklamanis, Dániel Marx, and Donald Sannella (Eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 36:1–36:13. https://doi.org/10.4230/LIPIcs.ICALP.2018.36Google ScholarGoogle Scholar
  6. Suryajith Chillara, Nutan Limaye, and Srikanth Srinivasan. 2019. Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications. SIAM J. Comput. 48, 1 (2019), 70–92. https://doi.org/10.1137/18M1191567Google ScholarGoogle ScholarCross RefCross Ref
  7. Suryajith Chillara and Partha Mukhopadhyay. 2019. Depth-4 lower bounds, determinantal complexity: A unified approach. Comput. Complex. (May 28, 2019). DOI:https://doi.org/10.1007/s00037-019-00185-4Google ScholarGoogle ScholarCross RefCross Ref
  8. Hervé Fournier, Nutan Limaye, Guillaume Malod, and Srikanth Srinivasan. 2015. Lower bounds for depth-4 formulas computing iterated matrix multiplication. SIAM J. Comput. 44, 5 (2015), 1173–1201. https://doi.org/10.1137/140990280Google ScholarGoogle ScholarCross RefCross Ref
  9. Ankit Gupta, Pritish Kamath, Neeraj Kayal, and Ramprasad Saptharishi. 2014. Approaching the chasm at depth four. JACM. 61, 6 (2014), 33. https://doi.org/10.1145/2629541Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Venkatesan Guruswami, Atri Rudra, and Madhu Sudan. 2019. Essential Coding Theory. https://cse.buffalo.edu/faculty/atri/courses/coding-theory/book/.Google ScholarGoogle Scholar
  11. Sumant Hegde and Chandan Saha. 2017. Improved lower bound for multi-r-ic depth four circuits as a function of the number of input variables. Proc. Indian Nat. Sci. Acad. 83, 4 (2017), 907–922. https://www.csa.iisc.ac.in/ chandan/research/multiric_d4.pdf.Google ScholarGoogle Scholar
  12. Pavel Hrubeš and Amir Yehudayoff. 2011. Homogeneous formulas and symmetric polynomials. Comput. Complex. 20, 3 (2011), 559–578. https://doi.org/10.1007/s00037-011-0007-3Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. K. Kalorkoti. 1985. A lower bound for the formula size of rational functions. SIAM J. Comput. 14, 3 (1985), 678–687. https://doi.org/10.1137/0214050Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Neeraj Kayal. 2012. An exponential lower bound for the sum of powers of bounded degree polynomials. Elect. Coll. Comput. Complex. (ECCC) 19 (2012), 81. http://eccc.hpi-web.de/report/2012/081.Google ScholarGoogle Scholar
  15. Neeraj Kayal, Nutan Limaye, Chandan Saha, and Srikanth Srinivasan. 2014a. Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. In Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, David B. Shmoys (Ed.). ACM, 119–127. https://doi.org/10.1145/2591796.2591823Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Neeraj Kayal, Nutan Limaye, Chandan Saha, and Srikanth Srinivasan. 2017. An exponential lower bound for homogeneous depth four arithmetic formulas. SIAM J. Comput. 46, 1 (2017), 307–335. https://doi.org/10.1137/151002423Google ScholarGoogle ScholarCross RefCross Ref
  17. Neeraj Kayal, Vineet Nair, and Chandan Saha. 2016. Separation between read-once oblivious algebraic branching programs (ROABPs) and multilinear depth three circuits. In Proceedings of Symposium on Theoretical Aspects of Computer Science (STACS’16). 46:1–46:15. DOI:https://doi.org/10.4230/LIPIcs.STACS.2016.46Google ScholarGoogle Scholar
  18. Neeraj Kayal and Chandan Saha. 2017. Multi-k-ic depth three circuit lower bound. Theory Comput. Syst. 61, 4 (2017), 1237–1251. https://doi.org/10.1007/s00224-016-9742-9Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Neeraj Kayal, Chandan Saha, and Ramprasad Saptharishi. 2014b. A super-polynomial lower bound for regular arithmetic formulas. In Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, David B. Shmoys (Ed.). ACM, 146–153. https://doi.org/10.1145/2591796.2591847Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Neeraj Kayal, Chandan Saha, and Sébastien Tavenas. 2018. On the size of homogeneous and of depth-four formulas with low individual degree. Theory Comput. 14, 16 (2018), 1–46. https://doi.org/10.4086/toc.2018.v014a016Google ScholarGoogle ScholarCross RefCross Ref
  21. Pascal Koiran. 2012. Arithmetic circuits: The chasm at depth four gets wider. Theor. Comput. Sci. 448 (2012), 56–65. https:// doi.org/10.1016/j.tcs.2012.03.041Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Mrinal Kumar, Rafael Mendes de Oliveira, and Ramprasad Saptharishi. 2019. Towards optimal depth reductions for syntactically multilinear circuits. In 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece (LIPIcs, Vol. 132), Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, and Stefano Leonardi (Eds.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 78:1–78:15.Google ScholarGoogle Scholar
  23. Mrinal Kumar and Shubhangi Saraf. 2017. On the power of homogeneous depth 4 arithmetic circuits. SIAM J. Comput. 46, 1 (2017), 336–387. https://doi.org/10.1137/140999335Google ScholarGoogle ScholarCross RefCross Ref
  24. Noam Nisan and Avi Wigderson. 1997. Lower bounds on arithmetic circuits via partial derivatives. Comput. Complex. 6, 3 (1997), 217–234. DOI:https://doi.org/10.1007/BF01294256Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Ran Raz. 2004. Multilinear- Multilinear-. In Proceedings of Foundations of Computer Science (FOCS’04). 344–351. DOI:https://doi.org/10.1109/FOCS.2004.42Google ScholarGoogle Scholar
  26. Ran Raz. 2006. Separation of multilinear circuit and formula size. Theory Comput. 2, 1 (2006), 121–135. DOI:https://doi.org/10.4086/toc.2006.v002a006Google ScholarGoogle ScholarCross RefCross Ref
  27. Ran Raz, Amir Shpilka, and Amir Yehudayoff. 2008. A lower bound for the size of syntactically multilinear arithmetic circuits. SIAM J. Comput. 38, 4 (2008), 1624–1647. DOI:https://doi.org/10.1137/070707932Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Ran Raz and Amir Yehudayoff. 2008. Balancing syntactically multilinear arithmetic circuits. Comput. Complex. 17, 4 (2008), 515–535. DOI:https://doi.org/10.1007/s00037-008-0254-0Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Ran Raz and Amir Yehudayoff. 2009. Lower bounds and separations for constant depth multilinear circuits. Comput. Complex. 18, 2 (2009), 171–207. DOI:https://doi.org/10.1007/s00037-009-0270-8Google ScholarGoogle ScholarCross RefCross Ref
  30. Ramprasad Saptharishi. 2019. A survey of lower bounds in arithmetic circuit complexity Version 8.0.4. (2019). Github Survey. https://github.com/dasarpmar/lowerbounds-survey/releases/.Google ScholarGoogle Scholar
  31. Amir Shpilka and Amir Yehudayoff. 2010. Arithmetic circuits: A survey of recent results and open questions. Found. Trends Theor. Comput. Sci. 5, 3–4 (March 2010), 207–388. Issue 3–4. DOI:http://dx.doi.org/10.1561/0400000039Google ScholarGoogle Scholar
  32. Volker Strassen. 1973. Berechnungen in partiellen Algebren endlichen Typs. Computing 11, 3 (1973), 181–196. https://doi.org/10.1007/BF02252909Google ScholarGoogle ScholarCross RefCross Ref
  33. Sébastien Tavenas. 2015. Improved bounds for reduction to depth 4 and depth 3. Inf. Comput. 240 (2015), 2–11. https:// doi.org/10.1016/j.ic.2014.09.004Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Leslie G. Valiant. 1979. Completeness classes in algebra. In Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA, Michael J. Fischer, Richard A. DeMillo, Nancy A. Lynch, Walter A. Burkhard, and Alfred V. Aho (Eds.). ACM, 249–261.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Article Metrics

        • Downloads (Last 12 months)5
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!