The following pages link to (Q3305356):
Displaying 8 items.
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- On the Complexity of Insertion Propagation with Functional Dependency Constraints (Q2817905) (← links)
- Enumeration complexity of logical query problems with second-order variables (Q2915682) (← links)
- The complexity of acyclic conjunctive queries (Q3196620) (← links)
- Semantically Acyclic Conjunctive Queries under Functional Dependencies (Q4635949) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- Trade-offs in Static and Dynamic Evaluation of Hierarchical Queries (Q6135781) (← links)
