A Dichotomy Theorem for Homomorphism Polynomials

  • Nicolas de Rugy-Altherre
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7464)

Abstract

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by arithmetic circuits in constant depth if H has a loop or no edges and that it is hard otherwise (i.e., complete for VNP, the arithmetic class related to #P). We also demonstrate the hardness over ℚ of cut eliminator, a polynomial defined by Bürgisser which is known to be neither VP nor VNP-complete in \(\mathbb F_2\), if VP ≠ VNP (VP is the class of polynomials computable by arithmetic circuits of polynomial size).

Keywords

Bipartite Graph Dichotomy Theorem Complete Bipartite Graph Homogeneous Component Conjunctive Query 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bag09]
    Bagan, G.: Algorithmes et complexité des problèmes d’énumération pour l’évalution de requêtes logique. PhD thesis, Université de Caen/Basse-Normandie (2009)Google Scholar
  2. [BG04]
    Bulatov, A.A., Grohe, M.: The Complexity of Partition Functions. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 294–306. Springer, Heidelberg (2004), doi:10.1007/978-3-540-27836-8-27CrossRefGoogle Scholar
  3. [BK09]
    Briquel, I., Koiran, P.: A Dichotomy Theorem for Polynomial Evaluation. In: Královič, R., Niwiński, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 187–198. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  4. [Bri11]
    Briquel, I.: Complexity issues in counting, polynomial evaluation and zero finding. PhD thesis, Lyon (2011)Google Scholar
  5. [Bür00]
    Bürgisser, P.: Completeness and Reduction in Algebraic Complexity Theory. Springer (2000)Google Scholar
  6. [CMR01]
    Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108(1–2), 23–52 (2001)MathSciNetMATHCrossRefGoogle Scholar
  7. [DG00]
    Dyer, M.E., Greenhill, C.S.: The complexity of counting graph homomorphisms. Random Struct. Algorithms 17(3-4), 260–289 (2000)MathSciNetMATHCrossRefGoogle Scholar
  8. [DM11]
    Durand, A., Mengel, S.: On polynomials defined by acyclic conjunctive queries and weighted counting problems. CoRR, abs/1110.4201 (2011)Google Scholar
  9. [FV98]
    Feder, T., Vardi, M.Y.: The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Computing 28(1), 57–104 (1998)MathSciNetMATHCrossRefGoogle Scholar
  10. [GT11]
    Grohe, M., Thurley, M.: Counting homomorphisms and partition functions. CoRR, abs/1104.0185 (2011)Google Scholar
  11. [HN04]
    Hell, P., Nesetril, J.: Graphs and Homomorphisms. Oxford University Press (2004)Google Scholar
  12. [MRar]
    Mahajan, M., Raghavendra Rao, B.V.: Small-space analogues of valiant’s classes and the limitations of skew formulas. Computational Complexity (to appear)Google Scholar
  13. [Poi08]
    Poizat, B.: À la recherche de la définition de la complexité d’espace pour le calcul des polynômes à la manière de valiant. Journal of Symbolic Logic 73 (2008)Google Scholar
  14. [Sch78]
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216–226. ACM, New York (1978)CrossRefGoogle Scholar
  15. [Val79a]
    Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 1979, pp. 249–261. ACM, New York (1979)CrossRefGoogle Scholar
  16. [Val79b]
    Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8(2), 189–201 (1979)MathSciNetMATHCrossRefGoogle Scholar
  17. [Val01]
    Valiant, L.G.: Quantum computers that can be simulated classically in polynomial time. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 114–123. ACM, New York (2001)CrossRefGoogle Scholar
  18. [Wel93]
    Welsh, D.J.A.: Complexity: knots, colourings and counting. London Mathematical Society Lecture Note Series. Cambridge University Press (1993)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Nicolas de Rugy-Altherre
    • 1
  1. 1.Institut de Mathématiques de Jussieu, UMR 7586 CNRSUniv Paris Diderot, Sorbonne Paris CitéParisFrance

Personalised recommendations