The complexity of computing the sign of the Tutte polynomial (and consequent \#P-hardness of approximation) (Q2843265)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6197690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of computing the sign of the Tutte polynomial (and consequent \#P-hardness of approximation) |
scientific article; zbMATH DE number 6197690 |
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
0.9895184636116028
0 references
0.8754448890686035
0 references
0.8743813037872314
0 references
0.8361291289329529
0 references
0.8311861157417297
0 references
