Combinatorial proof that subprojective constraint satisfaction problems are NP-complete

Jaroslav Nešetřil, Mark Siggers

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

We introduce a new general polynomial-time construction-the fibre construction- which reduces any constraint satisfaction problem CSP(ℋ) to the constraint satisfaction problem CSP(P), where P is any subprojective relational structure. As a consequence we get a new proof (not using universal algebra) that CSP(P) is NP-complete for any subprojective (and thus also projective) relational structure. This provides a starting point for a new combinatorial approach to the NP-completeness part of the conjectured Dichotomy Classification of CSPs, which was previously obtained by algebraic methods. This approach is flexible enough to yield NP-completeness of coloring problems with large girth and bounded degree restrictions.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings
PublisherSpringer Verlag
Pages159-170
Number of pages12
ISBN (Print)9783540744559
DOIs
StatePublished - 2007
Event32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007 - Cesky Krumlov, Czech Republic
Duration: 26 Aug 200731 Aug 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4708 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007
Country/TerritoryCzech Republic
CityCesky Krumlov
Period26/08/0731/08/07

Fingerprint

Dive into the research topics of 'Combinatorial proof that subprojective constraint satisfaction problems are NP-complete'. Together they form a unique fingerprint.

Cite this