Pages that link to "Item:Q929295"

The following pages link to The complexity of equality constraint languages (Q929295):

Displaying 22 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
• The complexity of counting quantifiers on equality languages (Q515549) (← links)
• PCPs via the low-degree long code and hardness for constrained hypergraph coloring (Q891178) (← links)
• Maximal infinite-valued constraint languages (Q1014639) (← links)
• Minimal functions on the random graph (Q2017162) (← links)
• General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
• Schaefer's Theorem for Graphs (Q2796406) (← links)
• Reconstructing the topology of clones (Q2960444) (← links)
• The Complexity of Counting Quantifiers on Equality Languages (Q3188273) (← links)
• Constraint Satisfaction Problems over the Integers with Successor (Q3448790) (← links)
• A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
• (Q4643959) (← links)
• Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures (Q4973030) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• (Q5094139) (← links)
• (Q5109509) (← links)
• The Complexity of Quantified Constraints Using the Algebraic Formulation (Q5111241) (← links)
• Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
• The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation (Q5875947) (← links)
• On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
• Collapsing the bounded width hierarchy for infinite-domain constraint satisfaction problems: when symmetries are enough (Q6654559) (← links)