The complexity of general-valued CSPs seen from the other side

The constraint satisfaction problem (CSP) is concerned with homomorphisms between two structures. For CSPs with restricted left-hand side structures, the results of Dalmau, Kolaitis, and Vardi [CP'02], Grohe [FOCS'03/JACM'07], and Atserias, Bulatov, and Dalmau [ICALP'07] establis...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Clement Carbonnel, Romero, Miguel, Zivny, Stanislav
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 03.10.2021
Subjects:	Algorithms Complexity Homomorphisms Polynomials
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!