Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
| Authors | |
|---|---|
| Publication date | 2017 |
| Journal | Electronic Notes in Discrete Mathematics |
| Volume | Issue number | 61 |
| Pages (from-to) | 971-977 |
| Organisations |
|
| 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. |
| Document type | Article |
| Language | English |
| Published at |
https://doi.org/10.1016/j.endm.2017.07.061
(Final published version)
|
| Other links | |
| Permalink to this page | |