The Complexity of Computing the Sign of the Tutte Polynomial

  title={The Complexity of Computing the Sign of the Tutte Polynomial},
  author={Leslie Ann Goldberg and Mark Jerrum},
  journal={SIAM J. Comput.},
We study the complexity of computing the sign of the Tutte polynomial of a graph. As there are only three possible outcomes (positive, negative, and zero), this seems at first sight more like a decision problem than a counting problem. Surprisingly, however, there are large regions of the parameter space for which computing the sign of the Tutte polynomial is actually #P-hard. As a trivial consequence, approximating the polynomial is also #P-hard in this case. Thus, approximately evaluating the… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 22 references

On the computational complexity of the Jones and Tutte polynomials

F. Jaeger, D. L. Vertigan, D.J.A. Welsh
Math. Proc. Cambridge Philos. Soc., 108 • 1990
View 5 Excerpts
Highly Influenced

Graphs & Digraphs

G. Chartrand, L. Lesniak, P. Zhang
5th ed., CRC Press, Boca Raton, FL • 2011

Correlation Inequalities for Tutte Polynomials

A. P. Mani
Ph.D. thesis, Monash University, Melbourne, Australia • 2010

Sokal , Zerofree regions for multivariate Tutte polynomials ( alias Pottsmodel partition functions ) of graphs and matroids

J. L. Jacobsen, J. Salas
J . Combin . Theory Ser . B • 2009

Similar Papers

Loading similar papers…