Pages that link to "Item:Q269342"
From MaRDI portal
The following pages link to Structural tractability of counting of solutions to conjunctive queries (Q269342):
Displaying 18 items.
- Tractable counting of the answers to conjunctive queries (Q389242) (← links)
- The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← links)
- Enumeration complexity of conjunctive queries with functional dependencies (Q778529) (← links)
- Characterizing tractability of simple well-designed pattern trees with projection (Q2035467) (← links)
- Tractable hypergraph properties for constraint satisfaction and conjunctive queries (Q2875201) (← links)
- Answering UCQs under updates and in the presence of integrity constraints (Q3305351) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- Counting Answers to Existential Questions (Q5091275) (← links)
- Size and Treewidth Bounds for Conjunctive Queries (Q5395686) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
- Theory and Applications of Satisfiability Testing (Q5714771) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- Exploiting Database Management Systems and Treewidth for Counting (Q6063876) (← links)
- Answer Counting under Guarded TGDs (Q6076172) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
- Counting Small Induced Subgraphs with Hereditary Properties (Q6154192) (← links)
- Parameterized Counting and Cayley Graph Expanders (Q6158357) (← links)
