Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems |
scientific article |
Statements
Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (English)
0 references
23 October 2020
0 references
constraint satisfaction
0 references
approximate counting
0 references
hardness of approximation
0 references
0 references
0 references
