Inapproximability of the Tutte polynomial
Authors:
- 1 July 2008
- journal article
- Published by Elsevier in Information and Computation
- Vol. 206 (7) , 908-929
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Inapproximability of the Tutte polynomial2007
- The Relative Complexity of Approximate Counting ProblemsAlgorithmica, 2003
- Counting, Sampling and Integrating: Algorithm and Complexity2003
- The complexity of counting graph homomorphismsRandom Structures & Algorithms, 2000
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense caseRandom Structures & Algorithms, 1995
- The Complexity of Multiterminal CutsSIAM Journal on Computing, 1994
- Polynomial-Time Approximation Algorithms for the Ising ModelSIAM Journal on Computing, 1993
- On the computational complexity of the Jones and Tutte polynomialsMathematical Proceedings of the Cambridge Philosophical Society, 1990
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- On the Dimer Solution of Planar Ising ModelsJournal of Mathematical Physics, 1966