Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735)

From MaRDI portal
Revision as of 13:30, 3 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references