The Tutte polynomial of a morphism of matroids 4. Computational complexity
Portugaliae Mathematica · 2007
DOI: 10.4171/pm/1788 ↗Kurz gefasst
Fachartikel in der Zeitschrift Portugaliae Mathematica, 2007. Verfasst von Michel Las Vergnas. Die Arbeit wurde bisher 5-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
Vergnas, M. L. (2007). The Tutte polynomial of a morphism of matroids 4. Computational complexity. Portugaliae Mathematica. https://doi.org/10.4171/pm/1788
Vancouver
Vergnas ML. The Tutte polynomial of a morphism of matroids 4. Computational complexity. Portugaliae Mathematica. 2007. doi:10.4171/pm/1788
BibTeX
@article{Vergnas2007,
author = {Vergnas, Michel Las},
title = {The Tutte polynomial of a morphism of matroids 4. Computational complexity},
journal = {Portugaliae Mathematica},
year = {2007},
doi = {10.4171/pm/1788}
}
EUVIMED