The complexity of approximating conservative counting CSPs (Q2957879)
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: The complexity of approximating conservative counting CSPs |
scientific article; zbMATH DE number 6678916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of approximating conservative counting CSPs |
scientific article; zbMATH DE number 6678916 |
Statements
30 January 2017
0 references
counting constraint satisfaction problem
0 references
approximation
0 references
complexity
0 references
The complexity of approximating conservative counting CSPs. (English)
0 references
0.9913879632949828
0 references
0.8529927134513855
0 references
0.8529639840126038
0 references
0.84717857837677
0 references
