No-Rainbow Problem and the Surjective Constraint Satisfaction Problem

The Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints, where a surjective assignment is an assignment containing all elements of the domain. In this paper we show that...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science S. 1 - 7
1. Verfasser: Zhuk, Dmitriy
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 29.06.2021
Schlagworte:
Computational complexity
Computer science
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints, where a surjective assignment is an assignment containing all elements of the domain. In this paper we show that the most famous SCSP, called No-Rainbow Problem, is NP-Hard. Additionally, we disprove the conjecture saying that the SCSP over a constraint language Γ and the CSP over the same language with constants have the same computational complexity up to poly-time reductions. Our counter-example also shows that the complexity of the SCSP cannot be described in terms of polymorphisms of the constraint language.
AbstractList The Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to some specified constraints, where a surjective assignment is an assignment containing all elements of the domain. In this paper we show that the most famous SCSP, called No-Rainbow Problem, is NP-Hard. Additionally, we disprove the conjecture saying that the SCSP over a constraint language Γ and the CSP over the same language with constants have the same computational complexity up to poly-time reductions. Our counter-example also shows that the complexity of the SCSP cannot be described in terms of polymorphisms of the constraint language.
Author Zhuk, Dmitriy
Author_xml – sequence: 1
  givenname: Dmitriy
  surname: Zhuk
  fullname: Zhuk, Dmitriy
  email: zhuk@intsys.msu.ru
  organization: HSE University,Russia
BookMark eNo1j91KxDAUhCMoqGufQJC8QOvJT5PmUsrqLiwqVq-Xk_YEu-w20kbFt7fgejXM8M3AXLLTIQ7E2I2AQghwt5t13ZRSGl1IkKJw2oJR8oRlzlbCmFLrypXmnGXTtAMAWVkB2l2w5WPMX7AffPzmz2P0ezpwHDqe3ok3n-OO2tR_Ea_jMKVx5hJvMPVTwDmPw3_lip0F3E-UHXXB3u6Xr_Uq3zw9rOu7TY6ycimn1gQENFor11Wz0wie2oA-AAmNyoJ33gXvZGtdV3ohBHVWhU5arwKoBbv-2-2JaPsx9gccf7bHs-oXgu5ONg
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS52264.2021.9470632
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore : IEEE Electronic Library (IEL) [unlimited simultaenous users]
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781665448956
1665448954
EndPage 7
ExternalDocumentID 9470632
Genre orig-research
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
APO
CBEJK
GUFHI
LHSKQ
RIE
RIO
ID FETCH-LOGICAL-a289t-ec6fa0a64439d8ec64a0becfabf0e14a370b9b9fb92c79d5b111ed73fd27b3f03
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:23:08 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a289t-ec6fa0a64439d8ec64a0becfabf0e14a370b9b9fb92c79d5b111ed73fd27b3f03
PageCount 7
ParticipantIDs ieee_primary_9470632
PublicationCentury 2000
PublicationDate 2021-June-29
PublicationDateYYYYMMDD 2021-06-29
PublicationDate_xml – month: 06
  year: 2021
  text: 2021-June-29
  day: 29
PublicationDecade 2020
PublicationTitle Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002871049
Score 2.185191
Snippet The Surjective Constraint Satisfaction Problem (SCSP) is the problem of deciding whether there exists a surjective assignment to a set of variables subject to...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Computational complexity
Computer science
Title No-Rainbow Problem and the Surjective Constraint Satisfaction Problem
URI https://ieeexplore.ieee.org/document/9470632
WOSCitedRecordID wos000947350400051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61ePDkoxXf5ODRtMkmdXbOpUVBSqEKvZU8JgcPWymtv99ku60KXrxtloSQCZn5MsmXj7F7HSxoG0iQG4AwXoNwyoOAMpKJilKMjLXYBEwm5XyO0xZ72HNhiKi-fEa9_Fmf5Yel3-RUWR8NpIiaHO4BAGy5Wvt8Skb-Ce02JGAlsf_yPJxldJEzJ4XqNY1_qajUQWR8_L_uT1j3m43Hp_s4c8paVJ2x450cA29WZ4eNJkvRHNfk-lknhtsq8ATx-Gyzet-6Np4lOmthiDWf_aA27Jp02dt49Dp8Eo1KgrBps7QW5B-jlTbhGo2hTCVjZZqYaF2UpIzVIB06jA4LDxgGLnk3CqBjKMDpKPU5a1fLii4YR4MyqsI60AMTQ4mlTYgAyZcJRyqES9bJVll8bB_CWDQGufr79zU7yobP96oKvGHt9WpDt-zQf6ahre7q2fsCkVOcbw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0QNNETKhi_7cGjhe22a7dnA4GIGxIw4Ub6MT14WAwBf7_tsqAmXry1TZt0O-nM22lfH8ADd1py7ZCiySQVlktqmJVU5h6FZxhipK_EJmRR5PO5mjTgcc-FQcTq8hl2Y7E6y3dLu4mpsp4SMkTU4HAPMiFStmVr7TMqEfsHvFvTgFmieuPR8zTii5g7SVm3Hv5LR6UKI4PW_yZwAp1vPh6Z7CPNKTSwPIPWTpCB1PuzDf1iSesDm9g_KsUQXToSQB6ZblbvW-dGokhnJQ2xJtMf5IbdkA68Dfqz5yGtdRKoDr9La4r2yetEB2TDlctDTegkmMZr4xNkQnOZGGWUNyq1UrnMBP-GTnLvUmm4T_g5NMtliRdAlFCJZ6k2kmfCu1zlOmAChTYPSJIpeQntuCqLj-1TGIt6Qa7-br6Ho-HsdbwYj4qXaziORoi3rFJ1A831aoO3cGg_w2eu7ipLfgHkF5-2
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=No-Rainbow+Problem+and+the+Surjective+Constraint+Satisfaction+Problem&rft.au=Zhuk%2C+Dmitriy&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FLICS52264.2021.9470632&rft.externalDocID=9470632