A computational proof of complexity of some restricted counting problems (Q534558): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.039 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2099255094 / rank | |||
Normal rank | |||
Revision as of 22:20, 19 March 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
