The complexity of ferromagnetic 2-spin systems on bounded degree graphs
DOI10.1016/j.tcs.2024.114940MaRDI QIDQ6664055
Yongzhi Cao, Zonglei Bai, Hanpin Wang
Publication date: 16 January 2025
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
This page was built for publication: The complexity of ferromagnetic 2-spin systems on bounded degree graphs
