Pages that link to "Item:Q3398315"

The following pages link to OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT (Q3398315):

Displaying 10 items.

• A new line of attack on the dichotomy conjecture (Q896081) (← links)
• Decidability of absorption in relational structures of bounded width. (Q2510713) (← links)
• On the CSP Dichotomy Conjecture (Q3007637) (← links)
• Constraint Satisfaction Problems Solvable by Local Consistency Methods (Q3189638) (← links)
• (Q4993594) (← links)
• Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
• Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
• The smallest hard trees (Q6073305) (← links)
• The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
• On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)