@InProceedings{barto_et_al:LIPIcs.STACS.2021.10,
author = {Barto, Libor and Battistelli, Diego and Berg, Kevin M.},
title = {{Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case}},
booktitle = {38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-180-1},
ISSN = {1868-8969},
year = {2021},
volume = {187},
editor = {Bl\"{a}ser, Markus and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2021.10},
URN = {urn:nbn:de:0030-drops-136557},
doi = {10.4230/LIPIcs.STACS.2021.10},
annote = {Keywords: constraint satisfaction problems, promise constraint satisfaction, Boolean PCSP, polymorphism}
}