Complexity Classification Transfer for CSPs via Algebraic Products

Research output: Preprint/documentation/reportPreprint



We study the complexity of infinite-domain constraint satisfaction problems: our basic setting is that a complexity classification for the CSPs of first-order expansions of a structure $\mathfrak A$ can be transferred to a classification of the CSPs of first-order expansions of another structure $\mathfrak B$. We exploit a product of structures (the algebraic product) that corresponds to the product of the respective polymorphism clones and present a complete complexity classification of the CSPs for first-order expansions of the $n$-fold algebraic power of $(\mathbb{Q};


Original languageUndefined
Publication statusPublished - 7 Nov 2022
No renderer: customAssociatesEventsRenderPortal,dk.atira.pure.api.shared.model.researchoutput.WorkingPaper



  • math.LO, cs.CC, cs.LO, 06A05, 68Q25, 08A70, F.4.1; F.2.2