Lee-Yang theorems and the complexity of computing averages

DOI10.1145/2488608.2488686zbMath1293.82007arXiv1211.2376OpenAlexW2071716077MaRDI QIDQ5495833

Alistair Sinclair, Piyush Srivastava

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.2376

zbMATH Keywords

Ising modelmonomer-dimer modelcounting problemsLee-Yang theorem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Related Items (3)

Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs ⋮ A logician's view of graph polynomials ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic

This page was built for publication: Lee-Yang theorems and the complexity of computing averages