Skip to main content
Log in

On the hardness of the noncommutative determinant

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

In this paper, we study the computational complexity of computing the noncommutative determinant. We first consider the arithmetic circuit complexity of computing the noncommutative determinant polynomial. Then, more generally, we also examine the complexity of computing the determinant (as a function) over noncommutative domains. Our hardness results are summarized below:

  1. We show that if the noncommutative determinant polynomial has small noncommutative arithmetic circuits then so does the noncommutative permanent. Consequently, the commutative permanent polynomial has small commutative arithmetic circuits.

  2. For any field \({\mathbb{F}}\) we show that computing the \({n\times n}\) permanent over \({\mathbb{F}}\) is polynomial-time reducible to computing the \({2n\times 2n}\) (noncommutative) determinant whose entries are \({O(n^2)\times O(n^2)}\) matrices over the field \({\mathbb{F}}\).

  3. We also derive as a consequence that computing the \({n\times n}\) permanent over nonnegative rationals is polynomial-time reducible to computing the noncommutative determinant over Clifford algebras of \({n^{O(1)}}\) dimension.

Our techniques are elementary and use primarily the notion of the Hadamard Product of noncommutative polynomials.

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

Access this article

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

  • Vikraman Arvind, Pushkar S. Joglekar & Srikanth Srinivasan (2009). Arithmetic Circuits and the Hadamard Product of Polynomials. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, December 15-17, 2009, IIT Kanpur, India, 25–36. URL http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2304.

  • Vikraman Arvind & Srikanth Srinivasan (2010). On the hardness of the noncommutative determinant. In Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, 677–686. URL http://doi.acm.org/10.1145/1806689.1806782.

  • Helmer Aslaksen (2009). Quaternionic determinants. The Mathematical Intelligencer 18(3), 57–65. ISSN 0343-6993. URL http://dx.doi.org/10.1007/BF03024312.

  • David A. Mix Barrington (1989). Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1. J. Comput. Syst. Sci. 38(1), 150–164. URL http://dx.doi.org/10.1016/0022-0000(89)90037-8.

  • Alexander Barvinok (2000). New Permanent Estimators via Non-Commutative Determinants. URL http://arxiv.org/abs/math/0007153.

  • Richard Beigel & John Gill (1992). Counting Classes: Thresholds, Parity, Mods, and Fewness. Theor. Comput. Sci. 103(1), 3–23. URL http://dx.doi.org/10.1016/0304-3975(92)90084-S.

  • Markus Bläser (2015). Noncommutativity makes determinants hard. Inf. Comput. 243, 133–144. URL http://dx.doi.org/10.1016/j.ic.2014.12.010.

  • Steve Chien, Prahladh Harsha, Alistair Sinclair & Srikanth Srinivasan (2011). Almost settling the hardness of noncommutative determinant. In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011, 499–508. URL http://doi.acm.org/10.1145/1993636.1993703.

  • Steve Chien, Lars Eilstrup Rasmussen & Alistair Sinclair (2003). Clifford algebras and approximating the permanent. J. Comput. Syst. Sci. 67(2), 263–290. URL http://dx.doi.org/10.1016/S0022-0000(03)00010-2.

  • Steve Chien & Alistair Sinclair (2007). Algebras with Polynomial Identities and Computing the Determinant. SIAM J. Comput. 37(1), 252–266. URL http://dx.doi.org/10.1137/S0097539705447359.

  • Stephen A. Fenner, Lance Fortnow & Stuart A. Kurtz (1994). Gap-Definable Counting Classes. J. Comput. Syst. Sci. 48(1), 116–148. URL http://dx.doi.org/10.1016/S0022-0000(05)80024-8.

  • Craig Gentry (2014). Noncommutative Determinant is Hard: A Simple Proof Using an Extension of Barrington’s Theorem. In IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014, 181–187. URL http://dx.doi.org/10.1109/CCC.2014.26.

  • Chris Godsil & Ivan Gutman (1981). On the matching polynomial of a graph. Algebraic Methods in Graph Theory I 241–249.

  • Pavel Hrubeš, Avi Wigderson & Amir Yehudayoff (2010). Relationless Completeness and Separations. In Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, June 9-12, 2010, 280–290. URL http://doi.ieeecomputersociety.org/10.1109/CCC.2010.34.

  • Narendra Karmarkar, Richard M. Karp, Richard J. Lipton, László Lovász & Michael Luby (1993). A Monte-Carlo Algorithm for Estimating the Permanent. SIAM J. Comput. 22(2), 284–293. URL http://dx.doi.org/10.1137/0222021.

  • T.Y. Lam (2005). Introduction to Quadratic Forms over Fields. American Mathematical Soc. ISBN 9780821872413.

  • Cristopher Moore & Alexander Russell (2012). Approximating the Permanent via Nonabelian Determinants. SIAM J. Comput. 41(2), 332–355. URL http://dx.doi.org/10.1137/100806709.

  • Noam Nisan (1991). 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, 410–418. URL http://doi.acm.org/10.1145/103418.103462.

  • Ran Raz & Amir Shpilka (2005). Deterministic polynomial identity testing in non-commutative models. Computational Complexity 14(1), 1–19. URL http://dx.doi.org/10.1007/s00037-005-0188-8.

  • Leslie G. Valiant (1979). The Complexity of Computing the Permanent. Theor. Comput. Sci. 8, 189–201. URL http://dx.doi.org/10.1016/0304-3975(79)90044-6.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to V. Arvind.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Arvind, V., Srinivasan, S. On the hardness of the noncommutative determinant. comput. complex. 27, 1–29 (2018). https://doi.org/10.1007/s00037-016-0148-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00037-016-0148-5

Keywords

Subject classification

Navigation