Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains
From MaRDI portal
Publication:2965524
DOI10.4230/LIPIcs.STACS.2014.651zbMath1359.68145arXiv1308.1394OpenAlexW2963464830MaRDI QIDQ2965524
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1308.1394
Related Items
The Complexity of General-Valued CSPs, Necessary Conditions for Tractability of Valued CSPs, Binarisation for Valued Constraint Satisfaction Problems, The Complexity of Valued CSPs, Unnamed Item