A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724): Difference between revisions
From MaRDI portal
Latest revision as of 12:51, 5 July 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