skip to main content
research-article

Noncommutative Valiant's Classes: Structure and Complete Problems

Authors Info & Claims
Published:13 October 2016Publication History
Skip Abstract Section

Abstract

In this article, we explore the noncommutative analogues, VPnc and VNPnc, of Valiant’s algebraic complexity classes and show some striking connections to classical formal language theory. Our main results are the following:

— We show that Dyck polynomials (defined from the Dyck languages of formal language theory) are complete for the class VPnc under ≤ abp reductions. To the best of our knowledge, these are the first natural polynomial families shown to be VPnc-complete. Likewise, it turns out that PAL (palindrome polynomials defined from palindromes) are complete for the class VSKEWnc (defined by polynomial-size skew circuits) under ≤ abp reductions. The proof of these results is by suitably adapting the classical Chomsky-Schützenberger theorem showing that Dyck languages are the hardest CFLs.

— Assuming that VPnc ≠ VNPnc, we exhibit a strictly infinite hierarchy of p-families, with respect to the projection reducibility, between the complexity classes VPnc and VNPnc (analogous to Ladner’s theorem [Ladner 1975]).

— Additionally, inside VPnc, we show that there is a strict hierarchy of p-families (based on the nesting depth of Dyck polynomials) with respect to the ≤abp reducibility (defined explicitly in this article).

References

  1. Vikraman Arvind, Pushkar S. Joglekar, and Srikanth Srinivasan. 2009. Arithmetic circuits and the Hadamard product of polynomials. In Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'09). 25--36. DOI:http://dx.doi.org/10.4230/LIPIcs.FSTTCS.2009.2304Google ScholarGoogle Scholar
  2. Vikraman Arvind, Gaurav Rattan, and Pushkar S. Joglekar. 2015. On the complexity of noncommutative polynomial factorization. In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS'15). 38--49. DOI:http://dx.doi.org/10.1007/978-3-662-48054-0_4 Google ScholarGoogle ScholarCross RefCross Ref
  3. Vikraman Arvind and Srikanth Srinivasan. 2010. On the hardness of the noncommutative determinant. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC'10). 677--686. DOI:http://dx.doi.org/10.1145/1806689.1806782 Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Alexander I. Barvinok. 1990. Computational complexity of immanant and representations of the full linear group. Functional Analysis and Its Applications 24, 2, 144--145. DOI:http://dx.doi.org/10.1007/BF01077707 Google ScholarGoogle ScholarCross RefCross Ref
  5. Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, and Stefano Varricchio. 2000. Learning functions represented as multiplicity automata. Journal of the ACM 47, 3, 506--530. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Berstel and C. Reutenauer. 2011. Noncommutative Rational Series with Applications. Cambridge University Press. https://books.google.co.in/books?id=LL8Nhn72I_8C.Google ScholarGoogle Scholar
  7. Peter Bürgisser. 1999. On the structure of Valiant's complexity classes. Discrete Mathematics and Theoretical Computer Science 3, 3, 73--94. http://dmtcs.loria.fr/volumes/abstracts/dm030301.abs.html.Google ScholarGoogle Scholar
  8. Peter Bürgisser. 2000a. The computational complexity of immanants. SIAM Journal on Computing 30, 3, 1023--1040. DOI:http://dx.doi.org/10.1137/S0097539798367880. Preliminary version at http://www.fpsac.org/FPSAC98/articles.htmlFPSAC'98. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Peter Bürgisser. 2000b. The computational complexity to evaluate representations of general linear groups. SIAM Journal on Computing 30, 3, 1010--1022. DOI:http://dx.doi.org/10.1137/S0097539798367892. Preliminary version at http://www.fpsac.org/FPSAC98/articles.htmlFPSAC'98. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Noam Chomsky and Marcel Paul Schützenberger. 1963. The algebraic theory of context-free languages. In Computer Programming and Formal Systems, P. Braffort and D. Hirshberg (Eds.). North-Holland, Amsterdam, Netherlands, 118--161. Google ScholarGoogle ScholarCross RefCross Ref
  11. Martin D. Davis, Ron Sigal, and Elaine J. Weyuker. 1994. Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (2nd ed.). Academic Press, San Diego, CA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Werner Hartmann. 1985. On the complexity of immanants. Linear and Multilinear Algebra 18, 2, 127--140. DOI:http://dx.doi.org/10.1080/03081088508817680 Google ScholarGoogle ScholarCross RefCross Ref
  13. Charles Thomas Hepler. 1994. On the Complexity of Computing Characters of a Finite Group. Master's Thesis. University of Calgary, Alberta, Canada.Google ScholarGoogle Scholar
  14. Pavel Hrubes, Avi Wigderson, and Amir Yehudayoff. 2010a. Non-commutative circuits and the sum-of-squares problem. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC'10). 667--676. DOI:http://dx.doi.org/10.1145/1806689.1806781 Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Pavel Hrubes, Avi Wigderson, and Amir Yehudayoff. 2010b. Relationless completeness and separations. In Proceedings of the 25th Annual IEEE Conference on Computational Complexity (CCC'10). 280--290. DOI:http://dx.doi.org/10.1109/CCC.2010.34 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Richard E. Ladner. 1975. On the structure of polynomial time reducibility. Journal of the ACM 22, 1, 155--171. DOI:http://dx.doi.org/10.1145/321864.321877 Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Nutan Limaye, Guillaume Malod, and Srikanth Srinivasan. 2015. Lower Bounds for Non-Commutative Skew Circuits. Electronic Colloquium on Computational Complexity. Retrieved September 17, 2016, from http://eccc.hpi-web.de/report/2015/022.Google ScholarGoogle Scholar
  18. Stephan Mertens and Cristopher Moore. 2013. The complexity of the fermionant and immanants of constant width {note}. Theory of Computing 9, 273--282. DOI:http://dx.doi.org/10.4086/toc.2013.v009a006 Google ScholarGoogle ScholarCross RefCross Ref
  19. Noam Nisan. 1991. Lower bounds for non-commutative computation (extended abstract). In Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC'91). 410--418. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Ran Raz and Amir Shpilka. 2005. Deterministic polynomial identity testing in non-commutative models. Computational Complexity 14, 1, 1--19. DOI:http://dx.doi.org/10.1007/s00037-005-0188-8 Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Volker Strassen. 1969. Gaussian elimination is not optimal. Numerische Mathematik 13, 4, 354--356. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Seinosuke Toda. 1992. Classes of arithmetic circuits capturing the complexity of computing the determinant. IEICE Transactions on Informations and Systems E75-D, 1, 116--124.Google ScholarGoogle Scholar
  23. Leslie G. Valiant. 1979. Completeness classes in algebra. In Proceedings of the 11h Annual ACM Symposium on Theory of Computing (STOC'79). 249--261. DOI:http://dx.doi.org/10.1145/800135.804419 Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Noncommutative Valiant's Classes: Structure and Complete Problems

      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

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

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

      Learn more

      Got it!