Pages that link to "Item:Q498405"
From MaRDI portal
The following pages link to The complexity of higher-order queries (Q498405):
Displaying 8 items.
- The query complexity of order-finding (Q596296) (← links)
- Approximate Query Complexity (Q2947556) (← links)
- On the Computational Power of Querying the History (Q3634005) (← links)
- (Q3793733) (← links)
- Nesting Depth of Operators in Graph Database Queries: Expressiveness Vs. Evaluation Complexity (Q4598259) (← links)
- Strongly-Normalizing Higher-Order Relational Queries (Q5043580) (← links)
- Query order in the polynomial hierarchy (Q5055937) (← links)
- The query complexity of certification (Q6083517) (← links)