The complexity of approximating bounded-degree Boolean \(\#\)CSP (Q1932171): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ic.2011.12.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966841310 / rank | |||
Normal rank | |||
Revision as of 23:52, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of approximating bounded-degree Boolean \(\#\)CSP |
scientific article |
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
