A computational proof of complexity of some restricted counting problems (Q534558): Difference between revisions
From MaRDI portal
Normalize DOI. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.10.039 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2010.10.039 / rank | |||
Normal rank | |||
Latest revision as of 20:49, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational proof of complexity of some restricted counting problems |
scientific article |
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
