Fast Algorithms for General Spin Systems on Bipartite Expanders
From MaRDI portal
Publication:5066144
DOI10.1145/3470865zbMath1495.68170arXiv2004.13442OpenAlexW3197026107MaRDI QIDQ5066144
No author found.
Publication date: 29 March 2022
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.13442
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Expander graphs (05C48)
Related Items (3)
Fast mixing via polymers for random graphs with unbounded degree ⋮ Homomorphisms from the torus ⋮ Polymer dynamics via cliques: new conditions for approximations
This page was built for publication: Fast Algorithms for General Spin Systems on Bipartite Expanders
