@InProceedings{galanis_et_al:LIPIcs.MFCS.2020.36,
author = {Galanis, Andreas and Goldberg, Leslie Ann and Herrera-Poyatos, Andr\'{e}s},
title = {{The Complexity of Approximating the Complex-Valued Potts Model}},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
pages = {36:1--36:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-159-7},
ISSN = {1868-8969},
year = {2020},
volume = {170},
editor = {Esparza, Javier and Kr\'{a}l', Daniel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.36},
URN = {urn:nbn:de:0030-drops-127038},
doi = {10.4230/LIPIcs.MFCS.2020.36},
annote = {Keywords: approximate counting, Potts model, Tutte polynomial, partition function, complex numbers}
}