Descriptive Complexity of approximate counting CSPs (Q2958520)
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: Descriptive Complexity of approximate counting CSPs |
scientific article; zbMATH DE number 6680134
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptive Complexity of approximate counting CSPs |
scientific article; zbMATH DE number 6680134 |
Statements
2 February 2017
0 references
constraint satisfaction problems
0 references
approximate counting
0 references
descriptive complexity
0 references
Descriptive Complexity of approximate counting CSPs (English)
0 references
0.9274683
0 references
0.9274683
0 references
0.92529595
0 references
0.92529595
0 references
0.9145458
0 references
0.9032754
0 references
0.90006053
0 references
0 references
