@InProceedings{bezakova_et_al:LIPIcs.ICALP.2019.22,
author = {Bez\'{a}kov\'{a}, Ivona and Galanis, Andreas and Goldberg, Leslie Ann and \v{S}tefankovi\v{c}, Daniel},
title = {{The Complexity of Approximating the Matching Polynomial in the Complex Plane}},
booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-109-2},
ISSN = {1868-8969},
year = {2019},
volume = {132},
editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.22},
URN = {urn:nbn:de:0030-drops-105983},
doi = {10.4230/LIPIcs.ICALP.2019.22},
annote = {Keywords: matchings, partition function, correlation decay, connective constant}
}