Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains

Hannes Uppman. Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains. In Ernst W. Mayr, Natacha Portier, editors, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France. Volume 25 of LIPIcs, pages 651-662, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]

@inproceedings{Uppman14,
  title = {Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains},
  author = {Hannes Uppman},
  year = {2014},
  doi = {10.4230/LIPIcs.STACS.2014.651},
  url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2014.651},
  researchr = {https://researchr.org/publication/Uppman14},
  cites = {0},
  citedby = {0},
  pages = {651-662},
  booktitle = {31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), STACS 2014, March 5-8, 2014, Lyon, France},
  editor = {Ernst W. Mayr and Natacha Portier},
  volume = {25},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-65-1},
}