Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models (Q5366911): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1203.2226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two possible values of the chromatic number of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The self-dual point of the two-dimensional random-cluster model is critical for \(q \geqslant 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factor models on locally tree-like graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Counting Independent Sets in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved inapproximability results for counting independent sets in the hard-core model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gibbs measures and phase transitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of two‐state spin systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of counting colourings and independent sets in sparse graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Regular Graphs: Asymptotic Distributions and Contiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3721805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Glauber dynamics on trees: Boundary conditions and mixing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast mixing for independent sets, colorings, and other models on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information, Physics, and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of sampling independent sets beyond the tree threshold / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved mixing condition on the grid for counting and sampling independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting in two-spin models on \(d\)-regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4413910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating partition functions of the two-state spin system / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1776308369 / rank
 
Normal rank

Latest revision as of 11:21, 30 July 2024

scientific article; zbMATH DE number 6788917
Language Label Description Also known as
English
Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models
scientific article; zbMATH DE number 6788917

    Statements

    Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models (English)
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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