Pages that link to "Item:Q2974510"

The following pages link to A Model-Theoretic View on Qualitative Constraint Reasoning (Q2974510):

Displaying 14 items.

• Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
• Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
• General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
• A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP (Q4957913) (← links)
• (Q5005145) (← links)
• Hardness of Network Satisfaction for Relation Algebras with Normal Representations (Q5098711) (← links)
• (Q5109509) (← links)
• 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
• Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
• The smallest hard trees (Q6073305) (← links)
• Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
• Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
• Smooth approximations and CSPs over finitely bounded homogeneous structures (Q6649468) (← links)