Pages that link to "Item:Q3305350"
From MaRDI portal
The following pages link to A More General Theory of Static Approximations for Conjunctive Queries (Q3305350):
Displaying 8 items.
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- Can datalog be approximated? (Q1376415) (← links)
- Dynamic complexity of expansion (Q2117075) (← links)
- The complexity of reverse engineering problems for conjunctive queries (Q3174895) (← links)
- Efficient Approximations of Conjunctive Queries (Q3190694) (← links)
- Semantic Optimization of Conjunctive Queries (Q5056448) (← links)
- Block-Sorted Quantified Conjunctive Queries (Q5327428) (← links)
- Theory and Applications of Satisfiability Testing (Q5714771) (← links)