The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems |
scientific article |
Statements
The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (English)
0 references
9 September 2016
0 references
Tutte polynomial
0 references
medial graphs
0 references
Eulerian partitions
0 references
Puiseux series
0 references
0 references
0 references
0.8351485133171082
0 references
0.8329626321792603
0 references
0.8262726068496704
0 references
0.8260396122932434
0 references
0.816612720489502
0 references
