The complexity of surjective homomorphism problems - a survey
Full text is not in this repository.
Official URL: http://dx.doi.org/10.1016/j.dam.2012.03.029
This item is available in the Library Catalogue
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:||Middlesex University Schools and Centres > School of Science and Technology > Computer Science|
Middlesex University Schools and Centres > School of Science and Technology > Computer Science > Foundations of Computing group
|Deposited On:||13 Dec 2012 07:00|
|Last Modified:||04 Nov 2014 14:32|
Repository staff only: item control page
Full text downloads (NB count will be zero if no full text documents are attached to the record)
Downloads per month over the past year