Pages that link to "Item:Q4434468"
From MaRDI portal
The following pages link to The computational complexity of two‐state spin systems (Q4434468):
Displaying 29 items.
- \(\#\)BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region (Q269470) (← links)
- Computational hardness of enumerating groundstates of the antiferromagnetic Ising model in triangulations (Q299048) (← links)
- Counting in two-spin models on \(d\)-regular graphs (Q471149) (← links)
- Approximating the partition function of planar two-state spin systems (Q743131) (← links)
- Computational implications of reducing data to sufficient statistics (Q887274) (← links)
- Complexity classification of the six-vertex model (Q1706146) (← links)
- The Ising partition function: zeros and deterministic approximation (Q1730971) (← links)
- Counting and sampling \(H\)-colourings (Q1887143) (← links)
- Approximating partition functions of the two-state spin system (Q1944117) (← links)
- Contraction: a unified perspective of correlation decay and zero-freeness of 2-spin systems (Q2060009) (← links)
- Lee-Yang theorems and the complexity of computing averages (Q2249768) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- Spatial mixing and the connective constant: optimal bounds (Q2359740) (← links)
- Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs (Q2511522) (← links)
- The complexity of partition functions (Q2581263) (← links)
- A graph polynomial for independent sets of bipartite graphs (Q2911069) (← links)
- Complexity of Ising polynomials (Q2911072) (← links)
- A complexity classification of spin systems with an external field (Q2962306) (← links)
- The Complexity of Ferromagnetic Two-spin Systems with External Fields (Q2969666) (← links)
- Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on <b>Z</b><sup>2</sup> (Q3430817) (← links)
- A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory (Q4993265) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)
- Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model (Q5009783) (← links)
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models (Q5366911) (← links)
- Lee-Yang theorems and the complexity of computing averages (Q5495833) (← links)
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results (Q5506693) (← links)
- Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← links)
- (Q5743449) (← links)
- The complexity of ferromagnetic 2-spin systems on bounded degree graphs (Q6664055) (← links)