@InProceedings{kompatscher_et_al:LIPIcs.STACS.2017.47,
author = {Kompatscher, Michael and Pham, Trung Van},
title = {{A Complexity Dichotomy for Poset Constraint Satisfaction}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {47:1--47:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.47},
URN = {urn:nbn:de:0030-drops-69850},
doi = {10.4230/LIPIcs.STACS.2017.47},
annote = {Keywords: Constraint Satisfaction, Random Partial Order, Computational Complexity, Universal Algebra, Ramsey Theory}
}