The complexity of computing the Tutte polynomial on transversal matroids (Q1842565): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q185366 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Martin Loebl / rank | |||
Normal rank | |||
Revision as of 19:37, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing the Tutte polynomial on transversal matroids |
scientific article |
Statements
The complexity of computing the Tutte polynomial on transversal matroids (English)
0 references
4 May 1995
0 references
The complexity of computing the Tutte polynomial is determined for transversal matroids.
0 references
complexity of computing
0 references
Tutte polynomial
0 references
transversal matroids
0 references
