##
###
More on zeros and approximation of the Ising partition function

Alexander Barvinok, Nicholas Barvinok

2021
*
Forum of Mathematics, Sigma
*

In *the* case of a quadratic polynomial f, we show that *the* *partition* *function* can be *approximated* within relative error $0 < \epsilon < 1$ in quasi-polynomial $n^{O(\ln n - \ln \epsilon )}$ time if *the* ...
We consider *the* problem of computing *the* *partition* *function* $\sum _x e^{f(x)}$ , where $f: \{-1, 1\}^n \longrightarrow {\mathbb R}$ *is* a quadratic or cubic polynomial on *the* Boolean cube $\{-1, 1\}^n$ ...
, as opposed to quasi-polynomial, if *the* degree of *the* underlying graph *is* bounded from above in advance, *and* to *the* anonymous referees for their careful reading of *the* paper *and* catching inaccuracies. ...

doi:10.1017/fms.2021.40
fatcat:it4d2qivtfbk3nwhdc5wyn2one