Pages that link to "Item:Q1028903"
From MaRDI portal
The following pages link to Determining the consistency of partial tree descriptions (Q1028903):
Displaying 4 items.
- Combining tree partitioning, precedence, and incomparability constraints (Q1020493) (← links)
- Hardness of Network Satisfaction for Relation Algebras with Normal Representations (Q5098711) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
