Algorithms for \#BIS-hard problems on expander graphs (Q3304735)
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 7226866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for \#BIS-hard problems on expander graphs |
scientific article; zbMATH DE number 7226866 |
Statements
Algorithms for #BIS-Hard Problems on Expander Graphs (English)
0 references
3 August 2020
0 references
approximate counting
0 references
expander graphs
0 references
hard-core model
0 references
cluster expansion
0 references
sampling
0 references
0 references
0 references
0 references
0 references
0.982291042804718
0 references
0.8383097052574158
0 references
0.8373771905899048
0 references
0.8258069753646851
0 references
0.8151118755340576
0 references
