Pages that link to "Item:Q5366911"

The following pages link to Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models (Q5366911):

Displaying 43 items.

• \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
• The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
• Approximating the partition function of planar two-state spin systems (Q743131) (← links)
• Computational implications of reducing data to sufficient statistics (Q887274) (← links)
• Bethe states of random factor graphs (Q1733816) (← links)
• Counting hypergraph matchings up to uniqueness threshold (Q1740650) (← links)
• Uniqueness for the 3-state antiferromagnetic Potts model on the tree (Q1990212) (← links)
• Mixing of Markov chains for independent sets on chordal graphs with bounded separators (Q2019517) (← links)
• Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems (Q2060009) (← links)
• Implementations and the independent set polynomial below the Shearer threshold (Q2098180) (← links)
• A spectral condition for spectral gap: fast mixing in high-temperature Ising models (Q2128105) (← links)
• Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
• An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
• Algorithmic Pirogov-Sinai theory (Q2174663) (← links)
• What can be sampled locally? (Q2189170) (← links)
• Large scale stochastic dynamics. Abstracts from the workshop held September 15--21, 2019 (Q2206640) (← links)
• Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
• Factor models on locally tree-like graphs (Q2434914) (← links)
• Location of zeros for the partition function of the Ising model on bounded degree graphs (Q3296755) (← links)
• Calculating eigenvalues of many-body systems from partition functions (Q3303310) (← links)
• Algorithms for #BIS-Hard Problems on Expander Graphs (Q3304735) (← links)
• Approximation via Correlation Decay When Strong Spatial Mixing Fails (Q4634020) (← links)
• Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model (Q4634031) (← links)
• Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models (Q4969061) (← links)
• More on zeros and approximation of the Ising partition function (Q4992410) (← links)
• Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model (Q5009783) (← links)
• Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870) (← links)
• (Q5159424) (← links)
• Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results (Q5506693) (← links)
• Efficient algorithms for approximating quantum partition functions (Q5855662) (← links)
• Dynamic Sampling from Graphical Models (Q5858642) (← links)
• The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← links)
• Counting Independent Sets and Colorings on Random Regular Bipartite Graphs (Q5875490) (← links)
• Uniqueness of the Gibbs measure for the 4-state anti-ferromagnetic Potts model on the regular tree (Q5885192) (← links)
• Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction (Q5885600) (← links)
• Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs (Q5890038) (← links)
• Efficient sampling and counting algorithms for the Potts model on <i>ℤ</i>^<i>d</i> at all temperatures (Q6051061) (← links)
• Perfect sampling from spatial mixing (Q6052473) (← links)
• Approximability of the complementarily symmetric Holant problems on cubic graphs (Q6076358) (← links)
• Uniqueness of the Gibbs measure for the anti-ferromagnetic Potts model on the infinite \(\Delta \)-regular tree for large \(\Delta \) (Q6081416) (← links)
• One-step replica symmetry breaking of random regular NAE-SAT. II (Q6119424) (← links)
• Inapproximability of counting independent sets in linear hypergraphs (Q6121429) (← links)
• Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs (Q6157383) (← links)