Pages that link to "Item:Q1292318"
From MaRDI portal
The following pages link to Computational complexity of relating time points with intervals (Q1292318):
Displaying 8 items.
- Point algebras for temporal reasoning: Algorithms and complexity (Q814509) (← links)
- The complexity of constraint satisfaction problems for small relation algebras (Q814599) (← links)
- Complexity classification in qualitative temporal constraint reasoning (Q814637) (← links)
- Computational complexity and feasibility of data processing and interval computations (Q1377914) (← links)
- A new approach to cyclic ordering of 2D orientations using ternary relation algebras (Q1583517) (← links)
- Branching interval algebra: an almost complete picture (Q2051838) (← links)
- Satisfying constraint sets through convex envelopes (Q3429327) (← links)
- From binary temporal relations to non-binary ones and back (Q5941132) (← links)