Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials

Abstract

We show a new way of constructing deterministic polynomial-time approximation algorithms for computing complex-valued evaluations of a large class of graph polynomials on bounded degree graphs. Our approach works for the Tutte polynomial, the independence polynomial, and partition functions of complex-valued spin- and edge-coloring models.