Abstract
The coloured Tutte polynomial by Bollobás and Riordan is, as a generalization of the Tutte polynomial, the most general graph polynomial for coloured graphs that satisfies certain contraction-deletion identities. Jaeger, Vertigan, and Welsh showed that the classical Tutte polynomial is #P-hard to evaluate almost everywhere by establishing reductions along curves and lines.
We establish a similar result for the coloured Tutte polynomial on integral domains. To capture the algebraic flavour and the uniformity inherent in this type of result, we introduce a new kind of reductions, uniform algebraic reductions, that are well-suited to investigate the evaluation complexity of graph polynomials. Our main result identifies a small, algebraic set of exceptional points and says that the evaluation problem of the coloured Tutte is equivalent for all non-exceptional points, under polynomial-time uniform algebraic reductions. On the way we obtain a self-contained proof for the difficult evaluations of the classical Tutte polynomial.
References
Averbouch, I., Makowsky, J.A.: The complexity of multivariate matching polynomials. Preprint (January 2007)
Averbouch, I., Godlin, B., Makowsky, J.A.: A most general edge elimination polynomial. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised Papers. Lecture Notes in Computer Science, vol. 5344, pp. 31–42. Springer, Berlin (2008)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Computing the Tutte polynomial in vertex-exponential time. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (Philadelphia, Pennsylvania, USA, October 25–28, 2008), pp. 677–686 (2008)
Bläser, M., Dell, H.: Complexity of the cover polynomial. In: Arge, L., Cachin, C., Jurdzinski, T., Tarlecki, A. (eds.) ICALP. Lecture Notes in Computer Science, vol. 4596, pp. 801–812. Springer, Berlin (2007)
Bläser, M., Hoffmann, C.: On the complexity of the interlace polynomial. 0707.4565 (2007)
Blum, L., Cucker, F., Shub, M., Smale, S.: Complexity and Real Computation. Springer, New York (1998)
Bollobás, B.: Modern Graph Theory. Springer, Berlin (1999)
Bollobás, B., Riordan, O.: A Tutte polynomial for coloured graphs. Comb. Probab. Comput. 8(1–2), 45–93 (1999)
Bürgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Grundlehren der mathematischen Wissenschaften. Springer, Berlin (1997)
Dell, H., Husfeldt, T., Wahlén, M.: Exponential time complexity of the permanent and the Tutte polynomial. (2009, to appear)
Dong, F.M., Koh, K.M., Teo, K.L.: Chromatic Polynomials and Chromaticity of Graphs. World Scientific, Singapore (2005)
Godlin, B., Kotek, T., Makowsky, J.A.: Evaluations of graph polynomials. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30–July 2, 2008. Revised Papers. Lecture Notes in Computer Science, vol. 5344, pp. 183–194. Springer, Berlin (2008)
Goldberg, L.A., Jerrum, M.: Inapproximability of the Tutte polynomial. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 459–468. ACM, New York (2007)
Hoffmann, C.: A most general edge elimination polynomial—thickening of edges. 0801.1600 (2008)
Jaeger, F., Vertigan, D.L., Welsh, D.J.A.: On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Camb. Philos. Soc. 108(1), 35–53 (1990)
Kauffman, L.H.: A Tutte polynomial for signed graphs. Discrete Appl. Math. 25, 105–127 (1989)
Linial, N.: Hard enumeration problems in geometry and combinatorics. SIAM J. Algebr. Discrete Methods 7(2), 331–335 (1986)
Lotz, M., Makowsky, J.A.: On the algebraic complexity of some families of coloured Tutte polynomials. Adv. Appl. Math. 32(1), 327–349 (2004)
Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Ann. Pure Appl. Log. 126, 1–3 (2004)
Makowsky, J.A.: From a zoo to a zoology: Towards a general theory of graph polynomials. Theory Comput. Syst. 43(3), 542–562 (2008)
Sokal, A.D.: The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In: Webb, B.S. (ed.) Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 327, pp. 173–226. Cambridge University Press, Cambridge (2005)
Stanley, R.P.: Acyclic orientations of graphs. Discrete Math. 306(10–11), 905–909 (2006)
Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 21(2), 865–877 (1991)
Toda, S., Watanabe, O.: Polynomial time 1-Turing reductions from #PH to #P. Theor. Comput. Sci. 100, 205–221 (1992)
Welsh, D.J.A.: Matroid Theory. London Mathematical Society Monographs, vol. 8. Academic Press, San Diego (1976)
Author information
Authors and Affiliations
Corresponding author
Additional information
H. Dell was supported by the Deutsche Forschungsgemeinschaft within the research training group “Methods for Discrete Structures” (GRK 1408).
J.A. Makowsky was partially supported by a grant of the Israel Science Foundation (2007–2010) and the Fund for the Promotion of Research of the Technion—Israel Institute of Technology.
Rights and permissions
About this article
Cite this article
Bläser, M., Dell, H. & Makowsky, J.A. Complexity of the Bollobás–Riordan Polynomial. Exceptional Points and Uniform Reductions. Theory Comput Syst 46, 690–706 (2010). https://doi.org/10.1007/s00224-009-9213-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-009-9213-7