@InProceedings{asimi_et_al:LIPIcs.MFCS.2021.11,
author = {Asimi, Kristina and Barto, Libor},
title = {{Finitely Tractable Promise Constraint Satisfaction Problems}},
booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
pages = {11:1--11:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-201-3},
ISSN = {1868-8969},
year = {2021},
volume = {202},
editor = {Bonchi, Filippo and Puglisi, Simon J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.11},
URN = {urn:nbn:de:0030-drops-144519},
doi = {10.4230/LIPIcs.MFCS.2021.11},
annote = {Keywords: Constraint satisfaction problems, promise constraint satisfaction, Boolean PCSP, polymorphism, finite tractability, homomorphic relaxation}
}