Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation | 0 | 0.34 | 2022 |
Network Satisfaction For Symmetric Relation Algebras With A Flexible Atom | 0 | 0.34 | 2021 |
A Proof Of The Algebraic Tractability Conjecture For Monotone Monadic Snp | 1 | 0.35 | 2021 |
Canonical functions: a proof via topological dynamics. | 0 | 0.34 | 2021 |
Canonical Polymorphisms of Ramsey Structures and the Unique Interpolation Property | 1 | 0.35 | 2021 |
Tractable Combinations of Theories via Sampling | 0 | 0.34 | 2021 |
Datalog-Expressibility for Monadic and Guarded Second-Order Logic | 0 | 0.34 | 2021 |
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems. | 0 | 0.34 | 2020 |
Hardness of Network Satisfaction for Relation Algebras with Normal Representations. | 0 | 0.34 | 2020 |
Temporal Constraint Satisfaction Problems in Fixed-Point Logic | 0 | 0.34 | 2020 |
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). | 0 | 0.34 | 2019 |
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) | 0 | 0.34 | 2019 |
A polynomial-time algorithm for median-closed semilinear constraints. | 0 | 0.34 | 2018 |
A Dichotomy for First-Order Reducts of Unary Structures. | 1 | 0.35 | 2018 |
Tropically Convex Constraint Satisfaction. | 1 | 0.37 | 2018 |
Submodular Functions and Valued Constraint Satisfaction Problems over Infinite Domains. | 0 | 0.34 | 2018 |
A universal-algebraic proof of the complexity dichotomy for Monotone Monadic SNP. | 1 | 0.35 | 2018 |
Complexity of Combinations of Qualitative Constraint Satisfaction Problems. | 0 | 0.34 | 2018 |
Classification transfer for qualitative reasoning problems. | 0 | 0.34 | 2018 |
The complexity of disjunctive linear Diophantine constraints. | 0 | 0.34 | 2018 |
Finite Relation Algebras with Normal Representations. | 0 | 0.34 | 2018 |
Classification Transfer for Qualitative Reasoning Problems. | 0 | 0.34 | 2018 |
Constraint Satisfaction Problems over Numeric Domains. | 0 | 0.34 | 2017 |
The Complexity of Phylogeny Constraint Satisfaction Problems. | 4 | 0.40 | 2017 |
A Model-Theoretic View on Qualitative Constraint Reasoning. | 5 | 0.41 | 2017 |
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. | 6 | 0.45 | 2016 |
The Reducts of the homogeneous Binary Branching C-Relation. | 1 | 0.35 | 2016 |
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs | 2 | 0.38 | 2016 |
Canonical Functions: A Proof Via Topological Dynamics | 1 | 0.35 | 2016 |
Distance constraint satisfaction problems. | 0 | 0.34 | 2016 |
The Complexity of Constraint Satisfaction Problems (Invited Talk). | 1 | 0.36 | 2015 |
Max-Closed Semilinear Constraint Satisfaction | 0 | 0.34 | 2015 |
The Complexity of Phylogeny Constraint Satisfaction. | 6 | 0.47 | 2015 |
New Ramsey Classes from Old. | 2 | 0.51 | 2014 |
Tractability Of Quantified Temporal Constraints To The Max | 0 | 0.34 | 2014 |
THE UNIVERSAL HOMOGENEOUS BINARY TREE | 2 | 0.48 | 2014 |
Projective Clone Homomorphisms | 11 | 0.60 | 2014 |
Reconstructing the topology of clones | 2 | 0.41 | 2013 |
Complexity of Existential Positive First-Order Logic | 3 | 0.48 | 2013 |
Topological Birkhoff | 0 | 0.34 | 2012 |
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. | 4 | 0.44 | 2012 |
On the Complexity of MMSNP | 6 | 0.42 | 2012 |
Complexity Classification in Infinite-Domain Constraint Satisfaction | 22 | 0.85 | 2012 |
The complexity of surjective homomorphism problems-a survey | 16 | 0.71 | 2012 |
Essential Convexity and Complexity of Semi-Algebraic Constraints | 42 | 1.61 | 2012 |
Equivalence Constraint Satisfaction Problems. | 3 | 0.40 | 2012 |
RCC8 is polynomial on networks of bounded treewidth | 12 | 0.63 | 2011 |
Decidability of definability. | 14 | 0.79 | 2011 |
Schaefer's theorem for graphs | 14 | 0.83 | 2011 |
Tractable Set Constraints | 1 | 0.36 | 2011 |