When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems

02/17/2020
by   Pierre Gillibert, et al.
0

We produce a class of ω-categorical structures with finite signature by applying a model-theoretic construction – a refinement of the Hrushosvki-encoding – to ω-categorical structures in a possibly infinite signature. We show that the encoded structures retain desirable algebraic properties of the original structures, but that the constraint satisfaction problems (CSPs) associated with these structures can be badly behaved in terms of computational complexity. This method allows us to systematically generate ω-categorical templates whose CSPs are complete for a variety of complexity classes of arbitrarily high complexity, and ω-categorical templates that show that membership in any given complexity class cannot be expressed by a set of identities on the polymorphisms. It moreover enables us to prove that recent results about the relevance of topology on polymorphism clones of ω-categorical structures also apply for CSP templates, i.e., structures in a finite language. Finally, we obtain a concrete algebraic criterion which could constitute a description of the delineation between tractability and NP-hardness in the dichotomy conjecture for first-order reducts of finitely bounded homogeneous structures.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2009

On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction

The universal-algebraic approach has proved a powerful tool in the study...
research
02/09/2018

A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP

The logic MMSNP is a restricted fragment of existential second-order log...
research
02/23/2023

Symmetries of structures that fail to interpret something finite

We investigate structural implications arising from the condition that a...
research
01/14/2019

Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems)

The algebraic dichotomy conjecture for Constraint Satisfaction Problems ...
research
01/14/2019

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)

The algebraic dichotomy conjecture for Constraint Satisfaction Problems ...
research
06/13/2020

ω-categorical structures avoiding height 1 identities

The algebraic dichotomy conjecture for Constraint Satisfaction Problems ...
research
10/13/2022

Notes on CSPs and Polymorphisms

These are notes from a multi-year learning seminar on the algebraic appr...

Please sign up or login with your details

Forgot password? Click here to reset