Pages that link to "Item:Q1307689"
From MaRDI portal
The following pages link to On the complexity of database queries (Q1307689):
Displaying 40 items.
- Some characterizations of \(\gamma \) and \(\beta \)-acyclicity of hypergraphs (Q456059) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- On the complexity of queries in the logical data model (Q688665) (← links)
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Strong computational lower bounds via parameterized complexity (Q856413) (← links)
- The complexity of tree automata and XPath on grammar-compressed trees (Q860863) (← links)
- Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Generic expression hardness results for primitive positive formula comparison (Q1951576) (← links)
- Characterizing tractability of simple well-designed pattern trees with projection (Q2035467) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- The hardness of resilience for nested aggregation query (Q2283020) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- On the computational hardness based on linear fpt-reductions (Q2498987) (← links)
- Parameterized computation and complexity: a new approach dealing with NP-hardness (Q2576825) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- On the number of databases and closure operations (Q2638763) (← links)
- On the complexity of query result diversification (Q2790132) (← links)
- Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints (Q2820687) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- Approximate Query Complexity (Q2947556) (← links)
- A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
- (Q3305356) (← links)
- Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)
- On the Computational Power of Querying the History (Q3634005) (← links)
- (Q3780501) (← links)
- (Q3793733) (← links)
- (Q4440857) (← links)
- (Q4966309) (← links)
- (Q5091134) (← links)
- (Q5091136) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- (Q5109514) (← links)
- (Q5150410) (← links)
- Transducing Markov sequences (Q5501935) (← links)
- The query complexity of certification (Q6083517) (← links)
