The complexity of surjective homomorphism problems - A survey

Publikation: Beitrag in FachzeitschriftForschungsartikelBeigetragenBegutachtung

Beitragende

  • Manuel Bodirsky - , Ecole Polytechnique (Autor:in)
  • Jan Kára - (Autor:in)
  • Barnaby Martin - (Autor:in)

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

OriginalspracheEnglisch
Seiten (von - bis)1680-1690
Seitenumfang11
FachzeitschriftDiscrete applied mathematics
Jahrgang160
Ausgabenummer12
PublikationsstatusVeröffentlicht - 2012
Peer-Review-StatusJa
Extern publiziertJa

Externe IDs

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

Schlagworte

Schlagwörter

  • Computational complexity, Constraint satisfaction, Surjective homomorphisms

Bibliotheksschlagworte