The Complexity of Surjective Homomorphism Problems -- a Survey
classification
💻 cs.CC
keywords
problemshomomorphismcomplexitysurjectiveliteraturesurveyarisenclassify
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.