The complexity of approximating conservative counting CSPs (Q743130)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6346989
| 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 6346989 |
Statements
The complexity of approximating conservative counting CSPs (English)
0 references
22 September 2014
0 references
approximation
0 references
counting complexity
0 references
constraint satisfaction problems
0 references
0 references
0.9913879632949828
0 references
0.8629940748214722
0 references
0.8527305722236633
0 references
0.8520297408103943
0 references
