Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems (extended abstract) (Q3087944)
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 (extended abstract) |
scientific article; zbMATH DE number 5940003
| 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 (extended abstract) |
scientific article; zbMATH DE number 5940003 |
Statements
Approximation Complexity of Complex-Weighted Degree-Two Counting Constraint Satisfaction Problems (English)
0 references
17 August 2011
0 references
counting CSP
0 references
bounded degree
0 references
Holant problem
0 references
signature
0 references
AP-reducibility
0 references
constructibility
0 references
symmetrization
0 references
0.9547424912452698
0 references
0.8551336526870728
0 references
