Smooth approximations and relational width collapses
From MaRDI portal
Cites work
- A complexity dichotomy for poset constraint satisfaction
- A dichotomy for first-order reducts of unary structures
- A dichotomy theorem for nonuniform CSPs
- A proof of CSP dichotomy conjecture
- A proof of the CSP dichotomy conjecture
- A Subalgebra Intersection Property for Congruence Distributive Varieties
- A universal-algebraic proof of the complexity dichotomy for monotone monadic SNP
- Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
- Asking the Metaquestions in Constraint Tractability
- Bounded width problems and algebras
- Characterizations of several Maltsev conditions.
- Congruence distributivity implies bounded width
- Conjunctive-query containment and constraint satisfaction
- Constraint satisfaction problems for reducts of homogeneous graphs
- Constraint Satisfaction Problems Solvable by Local Consistency Methods
- Constraint Satisfaction, Logic and Forbidden Patterns
- Datalog and constraint satisfaction with infinite templates
- Decidability of definability
- Discrete temporal constraint satisfaction problems
- Equivalence constraint satisfaction problems
- Existence theorems for weakly symmetric operations
- Fixed-point definability and polynomial time on graphs with excluded minors
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Graph isomorphism in quasipolynomial time (extended abstract)
- Hrushovski's encoding and -categorical CSP monsters
- scientific article; zbMATH DE number 1487982 (Why is no real title available?)
- scientific article; zbMATH DE number 7650924 (Why is no real title available?)
- On the Power of k-Consistency
- On the relational width of first-order expansions of finitely bounded homogeneous binary cores with bounded strict width
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- PROJECTIVE CLONE HOMOMORPHISMS
- Pseudo‐loop conditions
- Ramsey classes: examples and constructions
- Reasoning about temporal relations
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- Schaefer's theorem for graphs
- Temporal constraint satisfaction problems in fixed-point logic
- The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
- The collapse of the bounded width hierarchy
- The complexity of equality constraint languages
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The pebbling comonad in finite model theory
- The wonderland of reflections
- Topological Birkhoff
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
- Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems)
This page was built for publication: Smooth approximations and relational width collapses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241238)
