Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7265475
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems |
scientific article; zbMATH DE number 7265475 |
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
0.9237512350082396
0 references
0.9222341775894164
0 references
0.8762575387954712
0 references
