Pages that link to "Item:Q3388253"

The following pages link to Complexity of Infinite-Domain Constraint Satisfaction (Q3388253):

Displaying 20 items.

• Maximal infinite-valued constraint languages (Q1014639) (← links)
• Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) (Q2131194) (← links)
• Minimal inference problem over finite domains: the landscape of complexity (Q2401929) (← links)
• General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
• Universal Horn Sentences and the Joint Embedding Property (Q5038201) (← links)
• When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
• (Q5094139) (← links)
• Local–global property for G-invariant terms (Q5097711) (← links)
• Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← 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)
• The lattice of clones of self-dual operations collapsed (Q6116396) (← links)
• Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
• Unifying the three algebraic approaches to the CSP via minimal Taylor algebras (Q6566475) (← links)
• On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
• Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
• Exploring new topologies for the theory of clones (Q6640572) (← links)
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)
• Forbidden tournaments and the orientation completion problem (Q6668354) (← links)