Pages that link to "Item:Q342704"

The following pages link to The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704):

Displaying 10 items.

• \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
• The Ising partition function: zeros and deterministic approximation (Q1730971) (← links)
• Counting hypergraph matchings up to uniqueness threshold (Q1740650) (← links)
• Implementations and the independent set polynomial below the Shearer threshold (Q2098180) (← links)
• Zero-freeness and approximation of real Boolean Holant problems (Q2143138) (← links)
• Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255) (← links)
• The complexity of approximately counting in 2-spin systems on <i>k</i>-uniform bounded-degree hypergraphs (Q4575611) (← links)
• Approximation via Correlation Decay When Strong Spatial Mixing Fails (Q4634020) (← links)
• A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)
• The complexity of ferromagnetic 2-spin systems on bounded degree graphs (Q6664055) (← links)