Symetric Promise Constraint Satisfaction Problems: Beyond The Boolean Case

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F21%3A10437970" target="_blank" >RIV/00216208:11320/21:10437970 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.4230/LIPIcs.STACS.2021.10" target="_blank" >https://doi.org/10.4230/LIPIcs.STACS.2021.10</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4230/LIPIcs.STACS.2021.10" target="_blank" >10.4230/LIPIcs.STACS.2021.10</a>

Result language
angličtina
Original language name
Symetric Promise Constraint Satisfaction Problems: Beyond The Boolean Case
Original language description
The Promise Constraint Satisfaction Problem (PCSP) is a recently introduced vast generalization of the Constraint Satisfaction Problem (CSP). We investigate the computational complexity of a class of PCSPs beyond the most studied cases - approximation variants of satisfiability and graph coloring problems. We give an almost complete classification for the class of PCSPs of the form: given a 3-uniform hypergraph that has an admissible 2-coloring, find an admissible 3-coloring, where admissibility is given by a ternary symmetric relation. The only PCSP of this sort whose complexity is left open in this work is a natural hypergraph coloring problem, where admissibility is given by the relation "if two colors are equal, then the remaining one is higher."
Czech name
—
Czech description
—

Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Leibniz International Proceedings in Informatics, LIPIcs
ISBN
978-3-95977-180-1
ISSN
1868-8969
e-ISSN
—
Number of pages
16
Pages from-to
1-16
Publisher name
Schloss Dagstuhl
Place of publication
Německo
Event location
SRN
Event date
Mar 16, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000635691700010

Similar results(10)