Approximate counting for complex-weighted Boolean constraint satisfaction problems (Q690490)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate counting for complex-weighted Boolean constraint satisfaction problems |
scientific article |
Statements
Approximate counting for complex-weighted Boolean constraint satisfaction problems (English)
0 references
27 November 2012
0 references
constraint satisfaction problem
0 references
constraint
0 references
T-constructibility
0 references
Holant problem
0 references
signature
0 references
approximation-preserving reduction
0 references
dichotomy theorem
0 references
