Pages that link to "Item:Q5176024"

The following pages link to When is the evaluation of conjunctive queries tractable? (Q5176024):

Displaying 48 items.

• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• Computing hypergraph width measures exactly (Q437685) (← links)
• Foundations of semantic web databases (Q532369) (← links)
• Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
• The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
• Weighted hypertree decompositions and optimal query plans (Q878759) (← links)
• Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
• Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
• Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. (Q1401972) (← links)
• Describing parameterized complexity classes (Q1877556) (← links)
• How hard is completeness reasoning for conjunctive queries? (Q2019449) (← links)
• Characterizing tractability of simple well-designed pattern trees with projection (Q2035467) (← links)
• Some aspects of the database resilience (Q2119956) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• Evaluating Datalog via tree automata and cycluits (Q2322722) (← links)
• Structural tractability of enumerating CSP solutions (Q2342585) (← links)
• Answering conjunctive queries with inequalities (Q2402612) (← links)
• The price of query rewriting in ontology-based data access (Q2453744) (← links)
• A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
• Parameterized complexity of completeness reasoning for conjunctive queries (Q2661762) (← links)
• The fine classification of conjunctive queries and parameterized logarithmic space (Q2828230) (← links)
• Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Q3174894) (← links)
• The complexity of reverse engineering problems for conjunctive queries (Q3174895) (← links)
• A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
• Answering UCQs under updates and in the presence of integrity constraints (Q3305351) (← links)
• Fixed Structure Complexity (Q3503576) (← links)
• (Q4972729) (← links)
• Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
• Counting Homomorphisms to $K_4$-Minor-Free Graphs, Modulo 2 (Q5013574) (← links)
• Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
• (Q5088957) (← links)
• An Experimental Study of the Treewidth of Real-World Graph Data (Q5091123) (← links)
• (Q5091134) (← links)
• Counting Answers to Existential Questions (Q5091275) (← links)
• (Q5092423) (← links)
• Database Theory - ICDT 2005 (Q5316615) (← links)
• Size and Treewidth Bounds for Conjunctive Queries (Q5395686) (← links)
• On the complexity of existential positive queries (Q5410336) (← links)
• A Logical Approach to Constraint Satisfaction (Q5504702) (← links)
• Uniform Constraint Satisfaction Problems and Database Theory (Q5504703) (← links)
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
• Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
• Counting Small Induced Subgraphs with Hereditary Properties (Q6154192) (← links)
• Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)