Pages that link to "Item:Q3578192"
From MaRDI portal
The following pages link to The complexity of temporal constraint satisfaction problems (Q3578192):
Displaying 14 items.
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← links)
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← 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)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- Erdős-Szekeres theorem for multidimensional arrays (Q6172693) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
- On classifying continuous constraint satisfaction problems (Q6566470) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024 (Q6613406) (← links)
- Exponential Erdős-Szekeres theorem for matrices (Q6618020) (← links)
- Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
- Smooth approximations and CSPs over finitely bounded homogeneous structures (Q6649468) (← links)