Pages that link to "Item:Q696953"
From MaRDI portal
The following pages link to Inherent complexity of recursive queries (Q696953):
Displaying 9 items.
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- Bounded arity Datalog \((\neq)\) queries on graphs (Q1376404) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- The expressiveness of DAC (Q1608890) (← links)
- On datalog vs polynomial time (Q1900923) (← links)
- Approximate Query Complexity (Q2947556) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- (Q3830569) (← links)