Inapproximability of the Tutte polynomial

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 459-468

  Goldberg, Leslie Ann ^a   Jerrum, Mark ^b  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Approximation; Complexity; Tutte polynomial

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PROBLEM SOLVING;

FULLY POLYNOMIAL RANDOMISED APPROXIMATION SCHEME (FPRAS); TUTTE POLYNOMIALS; TWO-VARIABLE POLYNOMIALS;

POLYNOMIALS;

EID: 35448981866     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250858     Document Type: Conference Paper

References (20)

1. Noga Alon, Alan Frieze, and Dominic Welsh. Polynomial time randomized approximation schemes for Tutte-Gröthendieck invariants: the dense case. Random Struct. Algorithms, 6(4):459-478, 1995.
2. Thomas Brylawski. The Tutte polynomial. I. General theory. In Matroid theory and its applications, pages 125-275. Liguori, Naples, 1982.
3. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM J. Comput., 23(4):864-894, 1994.
4. Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill, and Mark Jerrum. The relative complexity of approximate counting problems. Algorithmica, 38(3):471-500, 2004.
5. Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, and Mark Jerrum. The relative complexity of approximate counting problems. Algorithmica, 38(3):471-500, 2003.
6. Martin E. Dyer and Catherine S. Greenhill. The complexity of counting graph homomorphisms. Random Structures and Algorithms, 17(3-4):260-289, 2000.
7. Michael E. Fisher. On the dimer solution of planar ising models. Journal of Mathematical Physics, 7(10): 1776-1781, 1966.
8. Greg N. Frederickson and Joseph Ja'Ja'. Approximation algorithms for several graph augmentation problems. SIAM J. Comput., 10(2):270-283, 1981.
9. F. Jaeger, D. L. Vertigan, and D. J. A. Welsh. On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc., 108(1):35-53, 1990.
10. Mark, Jerrum, and Alistair Sinclair. Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput., 22(5): 1087-1116, 1993.
11. Mark R. Jerrum, Leslie G. Valiant, and Vijay V. Vazirani. Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci., 43(2-3): 169-188, 1986.
12. David R. Karger. A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem. SIAMRev., 43(3):499-522, 2001.
13. P. D. Seymour. Nowhere-zero 6-flows. J. Combin. Theory Ser. B, 30(2):130-135, 1981.
14. Alan Sokal. The multivariate Tutte polynomial. In Surveys in Combinatorics. Cambridge University Press, 2005.
15. Larry Stockmeyer. The complexity of approximate counting. In STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing, pages 118-126, New York, NY, USA, 1983. ACM Press.
16. W. T. Tutte. Graph theory, volume 21 of Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Company Advanced Book Program, Reading, MA, 1984. With a foreword by C. St. J. A. Nash-Williams.
17. L. G. Valiant and V. V. Vazirani. NP is as easy as detecting unique solutions. Theor. Comput. Sci., 47(1):85-93, 1986.
18. D. J. A. Welsh. Complexity: knots, colourings and counting, volume 186 of London Mathematical Society Lecture Note Series. Cambridge University Press, Cambridge, 1993.
19. D. J. A. Welsh. Randomised approximation in the Tutte plane. Combin. Probab. Comput., 3(1):137-143, 1994.
20. David Zuckerman. On unapproximable versions of NP-Complete problems. SIAM Journal on Computing, 25(6): 1293-1304, 1996.