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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 82C20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6570307 / rank
 
Normal rank
Property / zbMATH Keywords
 
spin systems
Property / zbMATH Keywords: spin systems / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate counting
Property / zbMATH Keywords: approximate counting / rank
 
Normal rank
Property / zbMATH Keywords
 
complexity
Property / zbMATH Keywords: complexity / rank
 
Normal rank
Property / zbMATH Keywords
 
\(\#\)BIS-hardness
Property / zbMATH Keywords: \(\#\)BIS-hardness / rank
 
Normal rank
Property / zbMATH Keywords
 
phase transition
Property / zbMATH Keywords: phase transition / rank
 
Normal rank

Revision as of 16:13, 27 June 2023

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