Graph homomorphisms with complex values: a dichotomy theorem (Q5891164)
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 6211592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph homomorphisms with complex values: a dichotomy theorem |
scientific article; zbMATH DE number 6211592 |
Statements
25 September 2013
0 references
computational complexity
0 references
counting complexity
0 references
graph homomorphisms
0 references
partition functions
0 references
Graph homomorphisms with complex values: a dichotomy theorem (English)
0 references
0.9561787843704224
0 references
0.8945097923278809
0 references
0.8865460753440857
0 references
0.8542524576187134
0 references
