The Complexity of Approximating a Bethe Equilibrium
From MaRDI portal
Publication:2986268
DOI10.1109/TIT.2014.2317487zbMath1360.68790arXiv1109.1724MaRDI QIDQ2986268
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.1724
Analysis of algorithms and problem complexity (68Q25) Exactly solvable models; Bethe ansatz (82B23) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (3)
Convergence of MCMC and Loopy BP in the Tree Uniqueness Region for the Hard-Core Model ⋮ Diagonal stationary points of the Bethe functional ⋮ Gauges, loops, and polynomials for partition functions of graphical models
This page was built for publication: The Complexity of Approximating a Bethe Equilibrium