Computer Science – Computational Complexity
Scientific paper
2011-04-27
Computer Science
Computational Complexity
Scientific paper
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.
Bodirsky Manuel
Kara Jan
Martin Barnaby
No associations
LandOfFree
The Complexity of Surjective Homomorphism Problems -- a Survey does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Complexity of Surjective Homomorphism Problems -- a Survey, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Surjective Homomorphism Problems -- a Survey will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-448718