\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Mark R. Jerrum / rank
 
Normal rank
Property / author
 
Property / author: Daniel Štefanković / rank
 
Normal rank

Revision as of 12:48, 10 February 2024

scientific article
Language Label Description Also known as
English
\(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
scientific article

    Statements

    \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 April 2016
    0 references
    spin systems
    0 references
    approximate counting
    0 references
    complexity
    0 references
    \(\#\)BIS-hardness
    0 references
    phase transition
    0 references

    Identifiers

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