Computational complexity of Holant problems (Q3096095)
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 5968853
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of Holant problems |
scientific article; zbMATH DE number 5968853 |
Statements
Computational Complexity of Holant Problems (English)
0 references
7 November 2011
0 references
Holant problems
0 references
holographic reduction
0 references
polynomial interpolation
0 references
\#P-hardness
0 references
0.9572775959968568
0 references
0.924371600151062
0 references
0.9199011325836182
0 references
0.9193586707115172
0 references
0.9188989996910096
0 references
