The complexity of surjective homomorphism problems - a survey
Full text is not in this repository.
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 whose complexity remains open.
|Keywords (uncontrolled):||surjective homomorphisms; computational complexity; constraint satisfaction|
|Research Areas:||A. > School of Science and Technology > Computer Science
A. > School of Science and Technology > Computer Science > Foundations of Computing group
|Depositing User:||Devika Mohan|
|Date Deposited:||13 Dec 2012 07:00|
|Last Modified:||13 Oct 2016 14:25|
Actions (login required)