# Inapproximability of the Tutte polynomial

@article{Goldberg2008InapproximabilityOT, title={Inapproximability of the Tutte polynomial}, author={L. Goldberg and M. Jerrum}, journal={Inf. Comput.}, year={2008}, volume={206}, pages={908-929} }

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

23 Citations

Exponential Time Complexity of the Permanent and the Tutte Polynomial

- Computer Science, Mathematics
- 2010

- 6
- Highly Influenced
- PDF

A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid

- Computer Science, Mathematics
- 2011

- 3

Approximate counting for complex-weighted Boolean constraint satisfaction problems

- Computer Science, Mathematics
- 2012

- 10

Approximating the Partition Function of the Ferromagnetic Potts Model

- Computer Science, Mathematics
- 2010

- 26

Block interpolation: A framework for tight exponential-time counting complexity

- Computer Science, Mathematics
- 2018

- 12

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 37 REFERENCES

The multivariate

- 2005

Counting, sampling and integration: algorithms and complexity . Birkhauser Boston, also see author's website

- 2003

A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem

- Computer Science, Mathematics
- 2001

- 16
- PDF

A randomized fully polynomial time approximation scheme for the all terminal network reliability problem

- Computer Science
- 1995

- 167
- PDF

Approximation Algorithms for Several Graph Augmentation Problems

- Mathematics, Computer Science
- 1981

- 243

Complexity: Knots

- 1993

Complexity: knots, colourings and counting, volume 186 of London Mathematical Society Lecture Note Series

- 1993