The complexity of computing the Tutte polynomial on transversal matroids (Q1842565): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:43, 1 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
