Pages that link to "Item:Q1307689"
From MaRDI portal
The following pages link to On the complexity of database queries (Q1307689):
Displayed 12 items.
- Machine-based methods in parameterized complexity theory (Q557897) (← 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)
- 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)
- Computing the<i>j</i>th solution of a first-order query (Q3514640) (← links)