Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048)
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: Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations |
scientific article; zbMATH DE number 6596245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations |
scientific article; zbMATH DE number 6596245 |
Statements
Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (English)
0 references
22 June 2016
0 references
Ising model
0 references
triangulations
0 references
groundstates
0 references
parsimonious reduction
0 references
\(\# \operatorname{P}\)-completeness
0 references
0.7810895442962646
0 references
0.7659345269203186
0 references
0.7652888298034668
0 references
0.7485284805297852
0 references
0.7437371015548706
0 references
