Pages that link to "Item:Q1893732"
From MaRDI portal
The following pages link to On the power of deterministic transitive closures (Q1893732):
Displaying 15 items.
- On decidability of the theory with the transitive closure operator (Q266242) (← links)
- Transitive closure and related semiring properties via eliminants (Q1089083) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Size-estimation framework with applications to transitive closure and reachability (Q1384531) (← links)
- On the existence and construction of \(T\)-transitive closures. (Q1425263) (← links)
- A double arity hierarchy theorem for transitive closure logic (Q1913297) (← links)
- The impact of transitive closure on the expressiveness of navigational query languages on unlabeled graphs (Q2254638) (← links)
- Efficient computation of transitive closures (Q2639033) (← links)
- Pure Pointer Programs with Iteration (Q3540172) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- Decidability of weak logics with deterministic transitive closure (Q4635613) (← links)
- Relative expressive power of navigational querying on graphs using transitive closure (Q4644599) (← links)
- Reachability and the power of local ordering (Q4942645) (← links)
- Nested Pebbles and Transitive Closure (Q5449823) (← links)
- Separating LREC from LFP (Q6649491) (← links)