Three positive answers simplify the scope of the Bodirsky-Pinsker conjecture for infinite templates and connect tractable cases to finite-domain PCSPs via the sandwich method.
Reducts of finitely bounded homogeneous structures, and lifting tractabil- ity from finite-domain constraint satisfaction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
Three positive answers simplify the scope of the Bodirsky-Pinsker conjecture for infinite templates and connect tractable cases to finite-domain PCSPs via the sandwich method.