skip to main content
research-article

Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes

Authors Info & Claims
Published:01 September 2021Publication History
Skip Abstract Section

Abstract

We present polynomial families complete for the well-studied algebraic complexity classes VF, VBP, VP, and VNP. The polynomial families are based on the homomorphism polynomials studied in the recent works of Durand et al. (2014) and Mahajan et al. (2018). We consider three different variants of graph homomorphisms, namely injective homomorphisms, directed homomorphisms, and injective directed homomorphisms, and obtain polynomial families complete for VF, VBP, VP, and VNP under each one of these. The polynomial families have the following properties:

The polynomial families complete for VF, VBP, and VP are model independent, i.e., they do not use a particular instance of a formula, algebraic branching programs, or circuit for characterising VF, VBP, or VP, respectively.

All the polynomial families are hard under p-projections.

References

  1. Michael Ben-Or and Richard Cleve. 1992. Computing algebraic formulas using a constant number of registers. SIAM J. Comput. 21, 1 (1992), 54–58. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Peter Bürgisser. 2013. Completeness and Reduction in Algebraic Complexity Theory. Vol. 7. Springer Science & Business Media.Google ScholarGoogle ScholarCross RefCross Ref
  3. Florent Capelli, Arnaud Durand, and Stefan Mengel. 2016. The arithmetic complexity of tensor contraction. Theory Comput. Syst. 58, 4 (2016), 506–527. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Stephen A. Cook. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC'71). 151–158. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Nicolas de Rugy-Altherre. 2012. A dichotomy theorem for homomorphism polynomials. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science. Springer, 308–322. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, and Nitin Saurabh. 2014. Homomorphism polynomials complete for VP. In Leibniz International Proceedings in Informatics, Vol. 29.Google ScholarGoogle Scholar
  7. Christian Engels. 2016. Dichotomy theorems for homomorphism polynomials of graph classes. J. Graph Algor. Appl. 20, 1 (2016), 3–22.Google ScholarGoogle ScholarCross RefCross Ref
  8. Raymond Greenlaw, H. James Hoover, and Walter Ruzzo. 1992. A compendium of problems complete for P. Citeseer.Google ScholarGoogle Scholar
  9. Leonid A. Levin. 1973. Universal search problems. Probl. Inf. Transmiss. 9, 3 (1973). [in Russian]Google ScholarGoogle Scholar
  10. Meena Mahajan. 2013. Algebraic complexity classes. arXiv:cs.CC/1307.3863. Retrieved from https://arxiv.org/abs/1307.3863.Google ScholarGoogle Scholar
  11. Meena Mahajan and Nitin Saurabh. 2018. Some complete and intermediate polynomials in algebraic complexity theory. Theory Comput. Syst. 62, 3 (2018), 622–652. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Guillaume Malod and Natacha Portier. 2006. Characterizing valiant's algebraic complexity classes. In Proceedings of the International Symposium on Mathematical Foundations of Computer Science (MFCS'06). Springer, 704–716. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Stefan Mengel. 2011. Characterizing arithmetic circuit classes by constraint satisfaction problems. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP'11). Springer, 700–711. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Ran Raz. 2008. Elusive functions and lower bounds for arithmetic circuits. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing. ACM, 711–720. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nitin Saurabh. 2016. Analysis of Algebraic Complexity Classes and Boolean Functions. Ph.D. Dissertation. Institute of Mathematical sciences.Google ScholarGoogle Scholar
  16. L. G. Valiant. 1979. Completeness classes in algebra. In Proceedings of the 11th Annual ACM Symposium on Theory of Computing (STOC'79). 249–261. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes

        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

        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!