@InProceedings{gobel_et_al:LIPIcs.MFCS.2018.49,
author = {G\"{o}bel, Andreas and Lagodzinski, J. A. Gregor and Seidel, Karen},
title = {{Counting Homomorphisms to Trees Modulo a Prime}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {49:1--49:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-086-6},
ISSN = {1868-8969},
year = {2018},
volume = {117},
editor = {Potapov, Igor and Spirakis, Paul and Worrell, James},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2018.49},
URN = {urn:nbn:de:0030-drops-96315},
doi = {10.4230/LIPIcs.MFCS.2018.49},
annote = {Keywords: Algorithms, Theory, Graph Homomorphisms, Counting Modulo a Prime, Complexity Dichotomy}
}