@InProceedings{radoszewski_et_al:LIPIcs.ESA.2021.77,
author = {Radoszewski, Jakub and Rytter, Wojciech and Straszy\'{n}ski, Juliusz and Wale\'{n}, Tomasz and Zuba, Wiktor},
title = {{Hardness of Detecting Abelian and Additive Square Factors in Strings}},
booktitle = {29th Annual European Symposium on Algorithms (ESA 2021)},
pages = {77:1--77:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-204-4},
ISSN = {1868-8969},
year = {2021},
volume = {204},
editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2021.77},
URN = {urn:nbn:de:0030-drops-146581},
doi = {10.4230/LIPIcs.ESA.2021.77},
annote = {Keywords: Abelian square, additive square, 3SUM problem}
}