Hierarchies of minion tests for PCSPs through tensors
We provide a unified framework to study hierarchies of relaxations for Constraint Satisfaction
Problems and their Promise variant. The idea is to split the description of a hierarchy into an …
Problems and their Promise variant. The idea is to split the description of a hierarchy into an …
Smooth approximations and CSPs over finitely bounded homogeneous structures
We introduce the novel machinery of smooth approximations, and apply it to confirm the
CSP dichotomy conjecture for first-order reducts of the random tournament, and to give new …
CSP dichotomy conjecture for first-order reducts of the random tournament, and to give new …
Complexity classification transfer for CSPs via algebraic products
We study the complexity of infinite-domain constraint satisfaction problems (CSPs): our basic
setting is that a complexity classification for the CSPs of first-order expansions of a structure …
setting is that a complexity classification for the CSPs of first-order expansions of a structure …
Current challenges in infinite-domain constraint satisfaction: Dilemmas of the infinite sheep
M Pinsker - 2022 IEEE 52nd International Symposium on …, 2022 - ieeexplore.ieee.org
A Constraint Satisfaction Problem (CSP) is a computational problem where we are given
variables and constraints about them; the question is whether the variables can be assigned …
variables and constraints about them; the question is whether the variables can be assigned …
Forbidden tournaments and the orientation completion problem
M Bodirsky, S Guzmán-Pro - arXiv preprint arXiv:2309.08327, 2023 - arxiv.org
For a fixed finite set of finite tournaments ${\mathcal F} $, the ${\mathcal F} $-free orientation
problem asks whether a given finite undirected graph $ G $ has an $\mathcal F $-free …
problem asks whether a given finite undirected graph $ G $ has an $\mathcal F $-free …
Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures
We introduce the novel machinery of smooth approximations to provide a systematic
algebraic approach to the complexity of CSPs over finitely bounded homogeneous …
algebraic approach to the complexity of CSPs over finitely bounded homogeneous …
Promise and Infinite-Domain Constraint Satisfaction
A Mottet - 32nd EACSL Annual Conference on Computer …, 2024 - drops.dagstuhl.de
Two particularly active branches of research in constraint satisfaction are the study of
promise constraint satisfaction problems (PCSPs) with finite templates and the study of …
promise constraint satisfaction problems (PCSPs) with finite templates and the study of …
Strict width for Constraint Satisfaction Problems over homogeneous strucures of finite duality
T Nagy, M Pinsker - arXiv preprint arXiv:2402.09951, 2024 - arxiv.org
We investigate thelocal consistency implies global consistency'principle of strict width
among structures within the scope of the Bodirsky-Pinsker dichotomy conjecture for infinite …
among structures within the scope of the Bodirsky-Pinsker dichotomy conjecture for infinite …
The Sherali-Adams Hierarchy for Promise CSPs through Tensors
We study the Sherali-Adams linear programming hierarchy in the context of promise
constraint satisfaction problems (PCSPs). We characterise when a level of the hierarchy …
constraint satisfaction problems (PCSPs). We characterise when a level of the hierarchy …
When symmetries are enough: collapsing the bounded width hierarchy for infinite-domain CSPs
We prove that relational structures admitting specific polymorphisms (namely, canonical
pseudo-WNU operations of all arities $ n\geq 3$) have low relational width. This implies a …
pseudo-WNU operations of all arities $ n\geq 3$) have low relational width. This implies a …