The complexity of surjective homomorphism problems - a survey

Bodirsky, Manuel, Kara, Jan and Martin, Barnaby (2012) The complexity of surjective homomorphism problems - a survey. Discrete Applied Mathematics, 160 (12) . pp. 1680-1690. ISSN 0166-218X [Article]

Official URL: http://dx.doi.org/10.1016/j.dam.2012.03.029

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 whose complexity remains open.

Item Type:	Article
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
Item ID:	9646
Depositing User:	Devika Mohan
Date Deposited:	13 Dec 2012 07:00
Last Modified:	24 Apr 2018 11:58
URI:	https://eprints.mdx.ac.uk/id/eprint/9646

Actions (login required)

View Item

Statistics

DownloadsShow export options

Activity Overview

6 month trend

0Downloads

6 month trend

439Hits

Additional statistics are available via IRStats2.

CORE (COnnecting REpositories)