scientific article; zbMATH DE number 7650108
From MaRDI portal
Publication:5875497
DOI10.4230/LIPIcs.APPROX-RANDOM.2019.41MaRDI QIDQ5875497
No author found.
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1901.06653
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item ⋮ Algorithms for #BIS-Hard Problems on Expander Graphs ⋮ Unnamed Item ⋮ Polymer dynamics via cliques: new conditions for approximations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interfaces in the Potts model. I: Pirogov-Sinai theory of the Fortuin- Kasteleyn representation
- On the hardness of sampling independent sets beyond the tree threshold
- Cluster expansion for abstract polymer models
- A unified approach to phase diagrams in field theory and statistical mechanics
- Loss network representation of Peierls contours
- Approximation algorithms for the normalizing constant of Gibbs distributions
- Counting independent sets up to the tree threshold
- FPTAS for #BIS with Degree Bounds on One Side
- Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials
- Left and right convergence of graphs with bounded degree
- On Markov Chains for Independent Sets
- Algorithmic Pirogov-Sinai theory
- Algorithms for #BIS-hard problems on expander graphs
- Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs
