CSPs over FO expansions of finitely bounded homogeneous model-complete cores are either FO-definable (in non-uniform AC0) or L-hard under FO reductions.
The sorrows of a smooth digraph: the first hardness criterion for infinite di- rected graph-colouring problems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Constraint Satisfaction Problems over Finitely Bounded Homogeneous Structures: a Dichotomy between FO and L-hard
CSPs over FO expansions of finitely bounded homogeneous model-complete cores are either FO-definable (in non-uniform AC0) or L-hard under FO reductions.