Skip to main content
SpringerLink
Log in

Lower Bounds for Arithmetic Circuits via the Hankel Matrix

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

We study the complexity of representing polynomials by arithmetic circuits in both the commutative and the non-commutative settings. Our approach goes through a precise understanding of the more restricted setting where multiplication is not associative, meaning that we distinguish (xy)z from x(yz).

Our first and main conceptual result is a characterization result: We show that the size of the smallest circuit computing a given non-associative polynomial is exactly the rank of a matrix constructed from the polynomial and called the Hankel matrix. This result applies to the class of all circuits in both commutative and non-commutative settings, and can be seen as an extension of the seminal result of Nisan giving a similar characterization for non-commutative algebraic branching programs.

The study of the Hankel matrix provides a unifying approach for proving lower bounds for polynomials in the (classical) associative setting. Our key technical contribution is to provide generic lower bound theorems based on analyzing and decomposing the Hankel matrix. We obtain significant improvements on lower bounds for circuits with many parse trees, in both (associative) commutative and non-commutative settings, as well as alternative proofs of recent results proving superpolynomial and exponential lower bounds for different classes of circuits as corollaries of our characterization and decomposition results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Manindra Agrawal, Rohit Gurjar, Arpita Korwar & Nitin Saxena (2015). Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM Journal on Computing 44(3), 669–697.

  • Eric Allender, Jia Jiao, Meena Mahajan & V. Vinay (1998). Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. Theoretical Computer Science 209(1-2), 47–86.

  • Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay & S. Raja (2017). Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. In Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), volume 83 of LIPIcs, 38:1–38:13. Schloss Dagstuhl - Leibniz- Zentrum fuer Informatik. ISBN 978-3-95977-046-0. ISSN 1868-8969.

  • Vikraman Arvind & S. Raja (2016). Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Chicago Journal of Theoretical Computer Science 2016.

  • Walter Baur & Volker Strassen (1983). The Complexity of Partial Derivatives. Theoretical Computer Science 22, 317–330.

  • Symeon Bozapalidis & Olympia Louscou-Bozapalidou (1983). The Rank of a Formal Tree Power Series. Theoretical Computer Science27, 211–215.

  • Marco L. Carmosino, Russell Impagliazzo, Shachar Lovett & Ivan Mihajlin (2018). Hardness Amplification for Non-Commutative Arithmetic Circuits. In Proceedings of the 33rd Computational Complexity Conference (CCC 2018), volume 102 of LIPIcs, 12:1–12:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

  • Suryajith Chillara & Partha Mukhopadhyay (2019). Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. Computational Complexity 28(4), 545–572.

  • Zeev Dvir, Guillaume Malod, Sylvain Perifel & Amir Yehudayoff (2012). Separating multilinear branching programs and formulas. In Proceedings of the 44th Symposium on Theory of Computing Conference (STOC 2012), 615–624. ACM.

  • Nathanaël Fijalkow, Guillaume Lagarde & Pierre Ohlmann (2018). Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electronic Colloquium on Computational Complexity (ECCC) 25, 38. URL https://eccc.weizmann.ac.il/report/2018/038.

  • Michel Fliess (1974). Matrices de Hankel. Journal de Mathématiques Pures et Appliquées 53, 197–222.

  • Michael A. Forbes, Ramprasad Saptharishi & Amir Shpilka (2014). Hitting sets for multilinear read-once algebraic branching programs, in any order. In Proceedings of the 46th Symposium on Theory of Computing, (STOC 2014), 867–875. ACM.

  • Hervé Fournier, Nutan Limaye, Guillaume Malod & Srikanth Srinivasan (2014). Lower bounds for depth 4 formulas computing iterated matrix multiplication. In Proceedings of the 46th Symposium on Theory of Computing (STOC 2014), 128–135. ACM.

  • Ankit Gupta, Pritish Kamath, Neeraj Kayal & Ramprasad Saptharishi (2014). Approaching the Chasm at Depth Four. J. ACM 61(6), 33:1–33:16. URL https://doi.org/10.1145/2629541.

  • Rohit Gurjar, Arpita Korwar, Nitin Saxena & Thomas Thierauf (2017). Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. Computational Complexity 26(4), 835–880.

  • Pavel Hrubeš, Avi Wigderson & Amir Yehudayoff (2010). Relationless Completeness and Separations. In Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC 2010), 280–290. IEEE Computer Society.

  • Pavel Hrubeš, Avi Wigderson & Amir Yehudayoff (2011). Noncommutative circuits and the sum-of-squares problem. Journal of the American Mathematical Society 24(3), 871–898.

  • Laurent Hyafil (1977). The Power of Commutativity. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 1977), 171–174. IEEE Computer Society.

  • Mark Jerrum & Marc Snir (1982). Some Exact Complexity Results for Straight-Line Computations over Semirings. J. ACM 29(3), 874–897. URL https://doi.org/10.1145/322326.322341.

  • Valentine Kabanets & Russell Impagliazzo (2003). Derandomizing polynomial identity tests means proving circuit lower bounds. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC 2003), 355–364. ACM.

  • Neeraj Kayal, Nutan Limaye, Chandan Saha & Srikanth Srinivasan (2014a). An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, 61–70. IEEE Computer Society. URL https://doi.org/10.1109/FOCS.2014.15.

  • Neeraj Kayal, Chandan Saha & Ramprasad Saptharishi (2014b). A super-polynomial lower bound for regular arithmetic formulas. In Proceedings of the 46th Symposium on Theory of Computing, (STOC 2014), 146–153. ACM.

  • Mrinal Kumar & Shubhangi Saraf (2017). On the Power of Homogeneous Depth 4 Arithmetic Circuits. SIAM J. Comput. 46(1), 336–387. URL https://doi.org/10.1137/140999335.

  • Guillaume Lagarde, Nutan Limaye & Srikanth Srinivasan (2018). Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees. Computational Complexity 1–72.

  • Guillaume Lagarde, Guillaume Malod & Sylvain Perifel (2016). Non-commutative computations: lower bounds and polynomial identity testing. Electronic Colloquium on Computational Complexity (ECCC) 23, 94.

  • Nutan Limaye, Guillaume Malod & Srikanth Srinivasan (2016). Lower Bounds for Non-Commutative Skew Circuits. Theory of Computing 12(1), 1–38.

  • Guillaume Malod & Natacha Portier (2008). Characterizing Valiant’s algebraic complexity classes. Journal of Complexity 24(1), 16–38.

  • Noam Nisan (1991). Lower Bounds for Non-Commutative Computation (Extended Abstract). In Proceedings of the 23rd Symposium on Theory of Computing (STOC 1991), 410–418. ACM.

  • Noam Nisan & Avi Wigderson (1994). Hardness vs Randomness. Journal of Computer and System Sciences 49(2), 149–167.

  • Noam Nisan & Avi Wigderson (1997). Lower Bounds on Arithmetic Circuits Via Partial Derivatives. Computational Complexity 6(3), 217–234.

  • C. Ramya & B. V. Raghavendra Rao (2018). Lower Bounds for Special Cases of Syntactic Multilinear ABPs. In Proceedings of the 24th International Computing and Combinatorics Conference (COCOON 2018), volume 10976 of Lecture Notes in Computer Science, 701– 712. Springer.

  • Ran Raz & Amir Shpilka (2005). Deterministic polynomial identity testing in non-commutative models. Computational Complexity 14(1), 1–19.

  • Ramprasad Saptharishi & Anamay Tengse (2017). Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees. Electronic Colloquium on Computational Complexity (ECCC) 24, 135.

  • N. J. A. Sloane (editor) (2011). The On-Line Encyclopedia of Integer Sequences. Number of labeled rooted unordered binary trees (each node has out-degree \(\leq\) 2), https://oeis.org/A036774.

  • Seinosuke Toda (1992). Classes of Arithmetic Circuits Capturing the Complexity of Computing the Determinant. IEICE Trans. Inf. Systems E75-D(1), 116–124.

  • Leslie G. Valiant (1979). The Complexity of Computing the Permanent. Theoretical Computer Science 8, 189–201.

Download references

Author information

Authors and Affiliations

  1. CNRS, LaBRI, Bordeaux, France, The Alan Turing Institute of data science, London, United Kingdom

    Nathanaël Fijalkow

  2. LaBRI, Bordeaux, France

    Guillaume Lagarde

  3. Université de Paris, IRIF, CNRS, F-75013, Paris, France

    Pierre Ohlmann & Olivier Serre

Authors
  1. Nathanaël Fijalkow
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guillaume Lagarde
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pierre Ohlmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Olivier Serre
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guillaume Lagarde.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fijalkow, N., Lagarde, G., Ohlmann, P. et al. Lower Bounds for Arithmetic Circuits via the Hankel Matrix. comput. complex. 30, 14 (2021). https://doi.org/10.1007/s00037-021-00214-1

Download citation

  • Received:

  • Published:

  • DOI: https://doi.org/10.1007/s00037-021-00214-1

Keywords

Subject classification

Search

Navigation