The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q59474470, #quickstatements; #temporary_batch_1707337057885 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59474470 / rank | |||
Normal rank | |||
Revision as of 21:26, 7 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
