Inapproximability of the Tutte polynomial

  title={Inapproximability of the Tutte polynomial},
  author={L. Goldberg and M. Jerrum},
  journal={Inf. Comput.},
  • L. Goldberg, M. Jerrum
  • Published 2008
  • Computer Science, Mathematics
  • Inf. Comput.
  • The Tutte polynomial of a graph G is a two-variable polynomial T(G;x,y) that encodes many interesting properties of the graph. We study the complexity of the following problem, for rationals x and y: take as input a graph G, and output a value which is a good approximation to T(G;x,y). Jaeger et al. have completely mapped the complexity of exactly computing the Tutte polynomial. They have shown that this is #P-hard, except along the hyperbola (x-1)(y-1)=1 and at four special points. We are… CONTINUE READING
    Exponential Time Complexity of the Permanent and the Tutte Polynomial
    • 6
    • Highly Influenced
    • PDF
    Triangulations of Cayley and Tutte polytopes
    • 3
    • Highly Influenced
    • PDF
    Approximating the Partition Function of the Ferromagnetic Potts Model
    • 26
    Complexity and Approximability of the Cover Polynomial
    • 6
    • PDF
    Density of Real Zeros of the Tutte Polynomial


    Publications referenced by this paper.
    The multivariate
    • 2005
    Counting, sampling and integration: algorithms and complexity . Birkhauser Boston, also see author's website
    • 2003
    Hard enumeration problems in geometry and combinatorics
    • 117
    • Highly Influential
    • PDF
    A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
    • 16
    • PDF
    A contribution to the theory of chromatic polynomials
    • 869
    Approximation Algorithms for Several Graph Augmentation Problems
    • 243
    Complexity: Knots
    • 1993
    Complexity: Knots, Colourings and Counting
    • 348
    Complexity: knots, colourings and counting, volume 186 of London Mathematical Society Lecture Note Series
    • 1993