The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (Q2843265)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) |
scientific article |
Statements
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (English)
0 references
12 August 2013
0 references
Tutte polynomial of a graph
0 references
