Published in: LIPIcs, Volume 66, 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)
Michael Kompatscher and Trung Van Pham. A Complexity Dichotomy for Poset Constraint Satisfaction. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 47:1-47:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@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-dev.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} }
Published in: LIPIcs, Volume 47, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)
Manuel Bodirsky, Peter Jonsson, and Trung Van Pham. The Complexity of Phylogeny Constraint Satisfaction. In 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 47, pp. 20:1-20:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
@InProceedings{bodirsky_et_al:LIPIcs.STACS.2016.20, author = {Bodirsky, Manuel and Jonsson, Peter and Van Pham, Trung}, title = {{The Complexity of Phylogeny Constraint Satisfaction}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {20:1--20:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-001-9}, ISSN = {1868-8969}, year = {2016}, volume = {47}, editor = {Ollinger, Nicolas and Vollmer, Heribert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.20}, URN = {urn:nbn:de:0030-drops-57218}, doi = {10.4230/LIPIcs.STACS.2016.20}, annote = {Keywords: constraint satisfaction problems, computational complexity, phylogenetic reconstruction, ramsey theory, model theory} }
Feedback for Dagstuhl Publishing