Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard (Q2810271)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard
scientific article

    Statements

    Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate counting
    0 references
    \(H\)-colorings
    0 references
    counting independent sets in bipartite graphs
    0 references
    graph homomorphisms
    0 references