Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (Q690466)
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: Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems |
scientific article |
Statements
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (English)
0 references
27 November 2012
0 references
constraint satisfaction problem
0 references
\# CSP
0 references
bounded degree
0 references
AP-reducibility
0 references
constructibility
0 references
symmetrization
0 references
\# SAT
0 references
holant problem
0 references
signature
0 references
0.9547424912452698
0 references
0.8800222873687744
0 references
0.86446613073349
0 references
0.858171284198761
0 references
