Pages that link to "Item:Q2946603"
From MaRDI portal
The following pages link to A fast algorithm and datalog inexpressibility for temporal reasoning (Q2946603):
Displaying 6 items.
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- Relation algebras of Sugihara, Belnap, Meyer, and Church (Q2210869) (← links)
- Schaefer's Theorem for Graphs (Q2796406) (← links)
- Tractability of quantified temporal constraints to the max (Q5175605) (← links)
- On the descriptive complexity of temporal constraint satisfaction problems (Q6567262) (← links)
- Complexity classification transfer for CSPs via algebraic products (Q6621744) (← links)
