The Complexity of Approximating Bounded-Degree Boolean #CSP (Q3113760)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Approximating Bounded-Degree Boolean #CSP |
scientific article |
Statements
23 January 2012
0 references
Boolean constraint satisfaction problem
0 references
generalized satisfiability
0 references
counting
0 references
approximation algorithms
0 references
The Complexity of Approximating Bounded-Degree Boolean #CSP (English)
0 references
