@InProceedings{fulla_et_al:LIPIcs.MFCS.2017.4,
author = {Fulla, Peter and Zivny, Stanislav},
title = {{The Complexity of Boolean Surjective General-Valued CSPs}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.4},
URN = {urn:nbn:de:0030-drops-80623},
doi = {10.4230/LIPIcs.MFCS.2017.4},
annote = {Keywords: constraint satisfaction problems, surjective CSP, valued CSP, min-cut, polymorphisms, multimorphisms}
}