Smooth approximations and CSPs over finitely bounded homogeneous structures
type: Item
instance of: scholarly article
title: Smooth approximations and CSPs over finitely bounded homogeneous structures
DOI: 10.1145/3531130.3533353
author: Antoine Mottet
author: Michael Pinsker
publication date: 2024-12-06T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03C13
Mathematics Subject Classification ID: 08A40
Mathematics Subject Classification ID: 08A70
zbMATH DE Number: 7954851
MaRDI profile type: MaRDI publication profile
cites work: Q5144675
cites work: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures
cites work: Constraint Satisfaction Problems Solvable by Local Consistency Methods
cites work: The wonderland of reflections
cites work: The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
cites work: Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
cites work: Ontology-Based Data Access
cites work: Cores of Countably Categorical Structures
cites work: Ramsey classes: examples and constructions
cites work: The reducts of equality up to primitive positive interdefinability
cites work: Non-dichotomies in Constraint Satisfaction Complexity
cites work: A Model-Theoretic View on Qualitative Constraint Reasoning
cites work: Discrete Temporal Constraint Satisfaction Problems
cites work: The Complexity of Phylogeny Constraint Satisfaction
cites work: Q3549679
cites work: The complexity of temporal constraint satisfaction problems
cites work: The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
cites work: A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP
cites work: A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
cites work: Constraint satisfaction problems for reducts of homogeneous graphs
cites work: Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction
cites work: A Dichotomy for First-Order Reducts of Unary Structures
cites work: 𝜔-categorical structures avoiding height 1 identities
cites work: Constraint Satisfaction with Countable Homogeneous Templates
cites work: Temporal Constraint Satisfaction Problems in Fixed-Point Logic
cites work: Reducts of Ramsey structures
cites work: Minimal functions on the random graph
cites work: Schaefer's theorem for graphs
cites work: Topological Birkhoff
cites work: Q5154970
cites work: PROJECTIVE CLONE HOMOMORPHISMS
cites work: Decidability of Definability
cites work: Universal Horn Sentences and the Joint Embedding Property
cites work: \(H\)-coloring dichotomy revisited
cites work: Principles and Practice of Constraint Programming – CP 2003
cites work: Transitivity of permutation groups on unordered sets
cites work: Automorphism groups and Ramsey properties of sparse graphs
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: Uniform Birkhoff
cites work: When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems
cites work: The structure of finite algebras
cites work: Q4336034
cites work: All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
cites work: A complexity dichotomy for poset constraint satisfaction
cites work: Q5869576
cites work: Characterizations of several Maltsev conditions.
cites work: On the Structure of Polynomial Time Reducibility
cites work: Bounded width problems and algebras
cites work: Existence theorems for weakly symmetric operations
cites work: CORES OVER RAMSEY STRUCTURES
cites work: Ramsey classes of set systems
cites work: The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
cites work: The complexity of satisfiability problems
cites work: Reducts of the random graph
cites work: On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width
cites work: Q5874312
cites work: A Proof of the CSP Dichotomy Conjecture
description: scientific article; zbMATH DE number 7954851