A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the algebraic complexity of some families of coloured Tutte polynomials
2004
Advances in Applied Mathematics
We investigate the coloured Tutte polynomial in Valiant's algebraic framework of NP-completeness. Generalising the well-known relationship between the Tutte polynomial and the partition function from the Ising model, we establish a reduction from the permanent to the coloured Tutte polynomial, thus showing that its evaluation is a VNP-COMPLETE problem.
doi:10.1016/s0196-8858(03)00087-3
fatcat:4ui5xgsqzffilkh4valptjqr74