The Tutte polynomial of a morphism of matroids. IV: Computational complexity (Q2474788)

Summary: We determine the easy points of the 3-variable Tutte polynomial of a matroid perspective. It turns out that all but one of the sporadic easy points of the 3-variable Tutte polynomial proceed from the 8 sporadic easy points determined in the seminal paper of Jaeger-Vertigan-Welsh on the computational complexity of the Tutte polynomial of a matroid. The exceptional easy point, namely \((-1,-1,-1)\), can be evaluated with polynomial complexity for binary matroid perspectives by a previous result of the author. [For part III see \textit{G. Etienne} and the author, Adv. Appl. Math. 32, No. 1--2, 198--211 (2004; Zbl 1041.05015).]