Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for #BIS-Hard Problems on Expander Graphs |
scientific article |
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
