The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171)
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 bounded-degree Boolean \(\#\)CSP |
scientific article; zbMATH DE number 6126525
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of approximating bounded-degree Boolean \(\#\)CSP |
scientific article; zbMATH DE number 6126525 |
Statements
The complexity of approximating bounded-degree Boolean \(\#\)CSP (English)
0 references
17 January 2013
0 references
counting constraint satisfaction problem
0 references
CSP
0 references
approximation algorithm
0 references
complexity
0 references
0 references
