### 4 papers:

- ICALP-v1-2012-GoldbergJ #approximate #complexity #polynomial
- The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (LAG, MJ), pp. 399–410.
- ICALP-v1-2010-DellHW #complexity #exponential #polynomial
- Exponential Time Complexity of the Permanent and the Tutte Polynomial (HD, TH, MW), pp. 426–437.
- SOFTVIS-2008-ThompsonPAH #polynomial #visualisation
- Visualizing the computation tree of the Tutte Polynomial (BT, DJP, CA, GH), pp. 211–212.
- STOC-2007-GoldbergJ #polynomial
- Inapproximability of the Tutte polynomial (LAG, MJ), pp. 459–468.