Mottet, AntoineAntoineMottetPinsker, MichaelMichaelPinsker2024-11-152024-11-152024-10-05Journal of the ACM 71 (5): 36 (2024)https://hdl.handle.net/11420/51921We introduce the novel machinery of smooth approximations to provide a systematic algebraic approach to the complexity of CSPs over finitely bounded homogeneous structures. We apply smooth approximations to confirm the CSP dichotomy conjecture for first-order reducts of the random tournament and to give new short proofs of the conjecture for various homogeneous graphs including the random graph (STOC'11, ICALP'16, JACM 2015, SICOMP 2019), and for expansions of the order of the rationals (STOC'08, JACM 2009). Apart from obtaining these dichotomy results, we show how our new proof technique allows one to unify and significantly simplify the previous results from the literature. For all but the last structure, we moreover characterize for the first time those CSPs that are solvable by local consistency methods, again using the same machinery.en1557-735X20245ACMcomplexity dichotomyConstraint Satisfaction Problemfinitely boundedhomogeneousloop lemma\omega-categoricalpolymorphismstandard compactness argumentComputer Science, Information and General Works::004: Computer SciencesNatural Sciences and Mathematics::510: MathematicsJournal Article10.1145/3689207Journal Article