Structural tractability of counting of solutions to conjunctive queries (Q269342): Difference between revisions

@@ Property / cites work @@
+Q4864249
@@ Property / cites work: Q4864249 / rank @@
+Normal rank
@@ Property / cites work @@
+Hypertree width and related hypergraph invariants
@@ Property / cites work: Hypertree width and related hypergraph invariants / rank @@
+Normal rank
@@ Property / cites work @@
+On Acyclic Conjunctive Queries and Constant Delay Enumeration
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Enumerating homomorphisms
@@ Property / cites work: Enumerating homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+Hypertree decompositions and tractable queries
@@ Property / cites work: Hypertree decompositions and tractable queries / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond Hypertree Width: Decomposition Methods Without Decompositions
+Normal rank
@@ Property / cites work @@
+Decomposing Quantified Conjunctive (or Disjunctive) Formulas
+Normal rank
@@ Property / cites work @@
+A unified theory of structural tractability for constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Q4385531
@@ Property / cites work: Q4385531 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of weighted counting for acyclic conjunctive queries
+Normal rank
@@ Property / cites work @@
+Query evaluation via tree-decompositions
@@ Property / cites work: Query evaluation via tree-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of structural CSP decomposition methods
+Normal rank
@@ Property / cites work @@
+Generalized hypertree decompositions: NP-hardness and tractable variants
+Normal rank
@@ Property / cites work @@
+Structural tractability of enumerating CSP solutions
+Normal rank
@@ Property / cites work @@
+The complexity of homomorphism and constraint satisfaction problems seen from the other side
+Normal rank
@@ Property / cites work @@
+Constraint solving via fractional edge covers
@@ Property / cites work: Constraint solving via fractional edge covers / rank @@
+Normal rank
@@ Property / cites work @@
+When is the evaluation of conjunctive queries tractable?
+Normal rank
@@ Property / cites work @@
+Decomposing constraint satisfaction problems using database techniques
+Normal rank
@@ Property / cites work @@
+Conjunctive-query containment and constraint satisfaction
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating fractional hypertree width
@@ Property / cites work: Approximating fractional hypertree width / rank @@
+Normal rank
@@ Property / cites work @@
+Tractable counting of the answers to conjunctive queries
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank