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

2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), pp. 236.0-246, 2018.

Cited by: 4|Bibtex|Views8|Links
EI
Keywords:
valued constraint satisfactionhomomorphism problemsfractional homomorphismtreewidthSherali-Adams LP relaxation

Abstract:

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] establish the precise borderline of polynomial-time solvability (sub...More

Code:

Data:

Your rating :
0

 

Tags
Comments