Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089)
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: Partition functions on k-regular graphs with \0,1\-vertex assignments and real edge functions |
scientific article; zbMATH DE number 6244009
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions |
scientific article; zbMATH DE number 6244009 |
Statements
Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (English)
0 references
10 January 2014
0 references
partition function
0 references
dichotomy theorem
0 references
Holant problem
0 references
holographic algorithm
0 references
counting complexity
0 references
0 references
0.952519953250885
0 references
0.8700317740440369
0 references
0.8558060526847839
0 references
0.8522418737411499
0 references
0.848494291305542
0 references
