Pages that link to "Item:Q2877770"

The following pages link to Improved inapproximability results for counting independent sets in the hard-core model (Q2877770):

Displaying 13 items.

• \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
• Approximating the partition function of planar two-state spin systems (Q743131) (← links)
• The Ising partition function: zeros and deterministic approximation (Q1730971) (← links)
• Counting hypergraph matchings up to uniqueness threshold (Q1740650) (← links)
• Improved mixing condition on the grid for counting and sampling independent sets (Q1955841) (← links)
• Mixing of Markov chains for independent sets on chordal graphs with bounded separators (Q2019517) (← links)
• Zeros and approximations of holant polynomials on the complex plane (Q2169310) (← links)
• Spatial mixing and the connective constant: optimal bounds (Q2359740) (← links)
• Factor models on locally tree-like graphs (Q2434914) (← links)
• Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs (Q2511522) (← links)
• (Q3088127) (redirect page) (← links)
• Counting Constraint Satisfaction Problems. (Q4993601) (← links)
• Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs (Q6157383) (← links)