The complexity of weighted counting for acyclic conjunctive queries (Q395018): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2013.08.001
@@ Property / DOI: 10.1016/j.jcss.2013.08.001 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+P15
@@ Property / Mathematics Subject Classification ID: 68P15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6251123
@@ Property / zbMATH DE Number: 6251123 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+conjunctive queries
@@ Property / zbMATH Keywords: conjunctive queries / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+counting complexity
@@ Property / zbMATH Keywords: counting complexity / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2036350338
@@ Property / OpenAlex ID: W2036350338 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4201
@@ Property / arXiv ID: 1110.4201 / rank @@
+Normal rank
@@ Property / cites work @@
+Arithmetization: A new method in structural complexity theory
+Normal rank
@@ Property / cites work @@
+On Acyclic Conjunctive Queries and Constant Delay Enumeration
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+On the expressive power of CNF formulas of bounded tree- and clique-width
+Normal rank
@@ Property / cites work @@
+The Complexity of the Counting Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+The complexity of weighted and unweighted \(\#\)CSP
+Normal rank
@@ Property / cites work @@
+Complexity of counting CSP with complex weights
@@ Property / cites work: Complexity of counting CSP with complex weights / rank @@
+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 @@
+The complexity of counting homomorphisms seen from the other side
+Normal rank
@@ Property / cites work @@
+Subtractive reductions and complete problems for counting complexity classes
+Normal rank
@@ Property / cites work @@
+The Complexity of Weighted Boolean #CSP
@@ Property / cites work: The Complexity of Weighted Boolean #CSP / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of #CSP
@@ Property / cites work: On the complexity of #CSP / rank @@
+Normal rank
@@ Property / cites work @@
+Degrees of acyclicity for hypergraphs and relational database schemes
+Normal rank
@@ Property / cites work @@
+Counting truth assignments of formulas of bounded tree-width or clique-width
+Normal rank
@@ Property / cites work @@
+Query evaluation via tree-decompositions
@@ Property / cites work: Query evaluation via tree-decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of acyclic conjunctive queries
@@ Property / cites work: The complexity of acyclic conjunctive queries / 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 @@
+The complexity of homomorphism and constraint satisfaction problems seen from the other side
+Normal rank
@@ Property / cites work @@
+When is the evaluation of conjunctive queries tractable?
+Normal rank
@@ Property / cites work @@
+Exact algorithms and applications for tree-like Weighted Set Cover
+Normal rank
@@ Property / cites work @@
+Elements of finite model theory.
@@ Property / cites work: Elements of finite model theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing Valiant's algebraic complexity classes
+Normal rank
@@ Property / cites work @@
+Tractable hypergraph properties for constraint satisfaction and conjunctive queries
+Normal rank
@@ Property / cites work @@
+Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Tractable counting of the answers to conjunctive queries
+Normal rank
@@ Property / cites work @@
+Universality considerations in VLSI circuits
@@ Property / cites work: Universality considerations in VLSI circuits / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2013.08.001
@@ Property / DOI: 10.1016/J.JCSS.2013.08.001 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:395018