Inapproximability of the Tutte polynomial

Information and Computation

Volumn 206, Issue 7, 2008, Pages 908-929

  Goldberg, Leslie Ann ^a   Jerrum, Mark ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

#P HARD; (ALGORITHMIC) COMPLEXITY; (PL) PROPERTIES; APPROXIMATION SCHEMES; DECISION PROBLEMS; ELSEVIER (CO); GRAPH G; HALF-PLANES; INAPPROXIMABILITY; POLYNOMIAL-TIME; POSITIVE INTEGERS; TUTTE POLYNOMIALS;

EID: 46149085614     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.04.003     Document Type: Article

References (24)

1. Alon N., Frieze A., and Welsh D. Polynomial time randomized approximation schemes for Tutte-Gröthendieck invariants: the dense case. Random Struct. Algorithms 6 4 (1995) 459-478
2. Brylawski T. The Tutte polynomial. I. General theory. Matroid Theory and its Applications (1982), Liguori, Naples 125-275
3. Dahlhaus E., Johnson D.S., Papadimitriou C.H., Seymour P.D., and Yannakakis M. The complexity of multiterminal cuts. SIAM J. Comput. 23 4 (1994) 864-894
4. Dyer M., Goldberg L.A., Greenhill C., and Jerrum M. The relative complexity of approximate counting problems. Algorithmica 38 3 (2004) 471-500
5. Dyer M.E., and Greenhill C.S. The complexity of counting graph homomorphisms. Random Struct. Algorithms 17 3-4 (2000) 260-289
6. Fisher M.E. On the dimer solution of planar Ising models. J. Math. Phys. 7 10 (1966) 1776-1781
7. Frederickson G.N., and Ja'Ja' J. Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10 2 (1981) 270-283
8. M.R. Garey, D.S. Johnson, Computers and intractability. W.H. Freeman and Co., San Francisco, Calif., 1979. A guide to the theory of NP-completeness, A Series of Books in the Mathematical Sciences.
9. L.A. Goldberg, M. Jerrum, Inapproximability of the Tutte polynomial, in: STOC'07: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, USA, 2007, pp. 459-468.
10. Jaeger F., Vertigan D.L., and Welsh D.J.A. On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108 1 (1990) 35-53
11. M. Jerrum, Counting, sampling and integration: algorithms and complexity, Birkhauser Boston, also see author's website, 2003.
12. Jerrum M., and Sinclair A. Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput. 22 5 (1993) 1087-1116
13. Jerrum M.R., Valiant L.G., and Vazirani V.V. Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci. 43 2-3 (1986) 169-188
14. Karger D.R. A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAM Rev. 43 3 (2001) 499-522
15. Linial N. Hard enumeration problems in geometry and combinatorics. SIAM J. Algebraic Discrete Methods 7 2 (1986) 331-335
16. Seymour P.D. Nowhere-zero 6-flows. J. Combin. Theory B 30 2 (1981) 130-135
17. Sokal A. The multivariate. Tutte Polynomial in Surveys in Combinatorics (2005), Cambridge University Press
18. L. Stockmeyer, The complexity of approximate counting, in: STOC'83: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, ACM Press, New York, NY, USA, 1983, pp. 118-126.
19. Tutte W.T. A contribution to the theory of chromatic polynomials. Can. J. Math. 6 (1954) 80-91
20. W.T. Tutte, Graph theory, Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Company Advanced Book Program, Reading, MA, vol. 21, 1984. With a foreword by C. St. J.A. Nash-Williams.
21. Valiant L.G., and Vazirani V.V. NP is as easy as detecting unique solutions. Theor. Comput. Sci. 47 1 (1986) 85-93
22. D.J.A. Welsh, Complexity: Knots, Colourings and Counting, London Mathematical Society Lecture Note Series, vol. 186, Cambridge University Press, Cambridge, 1993.
23. Welsh D.J.A. Randomised approximation in the Tutte plane. Combin. Probab. Comput. 3 1 (1994) 137-143
24. Zuckerman D. On unapproximable versions of NP-complete problems. SIAM J. Comput. 25 6 (1996) 1293-1304