A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724): 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.2012.03.036 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1550829276 / rank | |||
Normal rank | |||
Revision as of 22:41, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs |
scientific article |
Statements
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (English)
0 references
13 August 2012
0 references
constraint satisfaction problem
0 references
\(\#\)CSP
0 references
bounded degree
0 references
approximate counting
0 references
dichotomy theorem
0 references
T-constructibility
0 references
signature
0 references
holant problem
0 references
