FPTAS for Hardcore and Ising Models on Hypergraphs
From MaRDI portal
Publication:4601903
DOI10.4230/LIPIcs.STACS.2016.51zbMath1388.68309arXiv1509.05494OpenAlexW2964304407MaRDI QIDQ4601903
Kuan Yang, Chihao Zhang, Pinyan Lu
Publication date: 24 January 2018
Full work available at URL: https://arxiv.org/abs/1509.05494
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Approximation algorithms (68W25)
Related Items (4)
The Ising partition function: zeros and deterministic approximation ⋮ Approximation via Correlation Decay When Strong Spatial Mixing Fails ⋮ Counting hypergraph matchings up to uniqueness threshold ⋮ More on zeros and approximation of the Ising partition function
This page was built for publication: FPTAS for Hardcore and Ising Models on Hypergraphs