The Complexity of Surjective Homomorphism Problems -- a Survey
Computational Complexity
2011-09-27 v2
Abstract
We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems, surjective homomorphism problems seem to be harder to classify and we examine especially three concrete problems that have arisen from the literature, two of which remain of open complexity.
Cite
@article{arxiv.1104.5257,
title = {The Complexity of Surjective Homomorphism Problems -- a Survey},
author = {Manuel Bodirsky and Jan Kara and Barnaby Martin},
journal= {arXiv preprint arXiv:1104.5257},
year = {2011}
}