A computational proof of complexity of some restricted counting problems (Q534558)
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: A computational proof of complexity of some restricted counting problems |
scientific article; zbMATH DE number 5895903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A computational proof of complexity of some restricted counting problems |
scientific article; zbMATH DE number 5895903 |
Statements
A computational proof of complexity of some restricted counting problems (English)
0 references
18 May 2011
0 references
Holant problem
0 references
holographic reduction
0 references
0.9801530838012696
0 references
0.8468872308731079
0 references
0.8355125784873962
0 references
0.8132326602935791
0 references
0.8127198815345764
0 references
