Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems)
Libor Barto, Michael Pinsker

TL;DR
This paper proves that the complexity boundary for certain infinite domain constraint satisfaction problems can be characterized solely by an algebraic identity, removing the need for topological considerations.
Contribution
It demonstrates that the tractability boundary for infinite domain CSPs is characterized by a specific algebraic identity, simplifying the understanding of the problem's complexity.
Findings
The complexity boundary is characterized by the pseudo-Siggers identity.
Topological properties are not essential in the algebraic characterization.
Provides a purely algebraic criterion for a topological property of $oldsymbol{ extomega}$-categorical structures.
Abstract
The tractability conjecture for finite domain Constraint Satisfaction Problems (CSPs) stated that such CSPs are solvable in polynomial time whenever there is no natural reduction, in some precise technical sense, from the 3-SAT problem; otherwise, they are NP-complete. Its recent resolution draws on an algebraic characterization of the conjectured borderline: the CSP of a finite structure permits no natural reduction from 3-SAT if and only if the stabilizer of the polymorphism clone of the core of the structure satisfies some nontrivial system of identities, and such satisfaction is always witnessed by several specific nontrivial systems of identities which do not depend on the structure. The tractability conjecture has been generalized in the above formulation to a certain class of infinite domain CSPs, namely, CSPs of reducts of finitely bounded homogeneous structures. It was…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization
