The complexity of general-valued CSPs seen from the other side
foundations of computer science, 2018.
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 [CPu002702], Grohe [FOCSu002703/JACMu002707], and Atserias, Bulatov, and Dalmau [ICALPu002707] establish the precise borderline of polynomial-time ...More
Full Text (Upload PDF)
PPT (Upload PPT)