The following pages link to Andreas Galanis (Q269465):
Displayed 47 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)
- Uniqueness for the 3-state antiferromagnetic Potts model on the tree (Q1990212) (← links)
- Implementations and the independent set polynomial below the Shearer threshold (Q2098180) (← links)
- The complexity of approximating the complex-valued Potts model (Q2125077) (← links)
- Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255) (← links)
- Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard (Q2810271) (← links)
- Improved inapproximability results for counting independent sets in the hard-core model (Q2877770) (← links)
- (Q2969647) (← links)
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results (Q2969655) (← links)
- Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness Region (Q3177756) (← links)
- Amplifiers for the Moran Process (Q3177886) (← links)
- Approximately Counting H-Colourings is $$\#\mathrm {BIS}$$-Hard (Q3448813) (← links)
- The complexity of approximately counting in 2-spin systems on <i>k</i>-uniform bounded-degree hypergraphs (Q4575611) (← links)
- (Q4598184) (← links)
- A complexity trichotomy for approximately counting list H-colourings (Q4598185) (← links)
- Amplifiers for the Moran Process (Q4598201) (← links)
- Swendsen‐Wang algorithm on the mean‐field Potts model (Q4625031) (← links)
- Approximation via Correlation Decay When Strong Spatial Mixing Fails (Q4634020) (← links)
- A Complexity Trichotomy for Approximately Counting List <i>H</i> -Colorings (Q4973886) (← links)
- Random Walks on Small World Networks (Q4987458) (← links)
- (Q5009528) (← links)
- Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q5028870) (← links)
- The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635) (← links)
- The complexity of approximating the complex-valued Potts model (Q5089203) (← links)
- (Q5091171) (← links)
- Counting Solutions to Random CNF Formulas (Q5096442) (← links)
- (Q5111357) (← links)
- (Q5111358) (← links)
- Inapproximability of the Independent Set Polynomial in the Complex Plane (Q5129229) (← links)
- Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs (Q5220472) (← links)
- Inapproximability of the independent set polynomial in the complex plane (Q5230376) (← links)
- Swendsen-Wang Algorithm on the Mean-Field Potts Model (Q5351937) (← links)
- Inapproximability of the Partition Function for the Antiferromagnetic Ising and Hard-Core Models (Q5366911) (← links)
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results (Q5506693) (← links)
- The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs (Q5866450) (← links)
- (Q5875505) (← links)
- (Q6147346) (← links)
- (Q6147349) (← links)
- Metastability of the Potts ferromagnet on random regular graphs (Q6160255) (← links)
- Sampling in Uniqueness from the Potts and Random-Cluster Models on Random Regular Graphs (Q6300643) (← links)
- Fast algorithms at low temperatures via Markov chains (Q6312736) (← links)
- The complexity of approximating the complex-valued Potts model (Q6339918) (← links)
- Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs (Q6343793) (← links)
- The complexity of approximating the complex-valued Ising model on bounded degree graphs (Q6366603) (← links)
- Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the Non-Uniqueness Region (Q6366853) (← links)
- Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics (Q6437535) (← links)