The complexity of surjective homomorphism problems - A survey

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

  • Manuel Bodirsky - , Ecole Polytechnique (Author)
  • Jan Kára - (Author)
  • Barnaby Martin - (Author)

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. © 2012 Elsevier B.V. All rights reserved.

Details

Original languageEnglish
Pages (from-to)1680-1690
Number of pages11
JournalDiscrete applied mathematics
Volume160
Issue number12
Publication statusPublished - 2012
Peer-reviewedYes
Externally publishedYes

External IDs

Scopus 84861185469
ORCID /0000-0001-8228-3611/work/142241162

Keywords

Keywords

  • Computational complexity, Constraint satisfaction, Surjective homomorphisms