A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs (Q443724)
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 dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs |
scientific article; zbMATH DE number 6065024
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs |
scientific article; zbMATH DE number 6065024 |
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
