Approximately counting \(H\)-colorings is \(\#\)BIS-hard (Q2810271)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximately counting H-colorings is \#BIS-hard |
scientific article; zbMATH DE number 6588077
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximately counting \(H\)-colorings is \(\#\)BIS-hard |
scientific article; zbMATH DE number 6588077 |
Statements
1 June 2016
0 references
approximate counting
0 references
\(H\)-colorings
0 references
counting independent sets in bipartite graphs
0 references
graph homomorphisms
0 references
Approximately counting \(H\)-colorings is \(\#\)BIS-hard (English)
0 references
0.9882763028144836
0 references
0.89040207862854
0 references
0.8807510137557983
0 references
0.8435308337211609
0 references
0.8429313898086548
0 references
