Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The Parameterized Complexity of Counting Problems
SIAM Journal on Computing
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Subtractive reductions and complete problems for counting complexity classes
Theoretical Computer Science - Mathematical foundations of computer science 2000
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Exact algorithms and applications for Tree-like Weighted Set Cover
Journal of Discrete Algorithms
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Counting truth assignments of formulas of bounded tree-width or clique-width
Discrete Applied Mathematics
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
The Complexity of the Counting Constraint Satisfaction Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
The Complexity of Weighted Boolean CSP
SIAM Journal on Computing
Proceedings of the forty-second ACM symposium on Theory of computing
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
On the expressive power of CNF formulas of bounded tree- and clique-width
Discrete Applied Mathematics
Universality considerations in VLSI circuits
IEEE Transactions on Computers
Non-negatively Weighted #CSP: An Effective Complexity Dichotomy
CCC '11 Proceedings of the 2011 IEEE 26th Annual Conference on Computational Complexity
Characterizing arithmetic circuit classes by constraint satisfaction problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
The complexity of weighted and unweighted #CSP
Journal of Computer and System Sciences
Complexity of counting CSP with complex weights
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On acyclic conjunctive queries and constant delay enumeration
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Structural tractability of counting of solutions to conjunctive queries
Proceedings of the 16th International Conference on Database Theory
Tractable counting of the answers to conjunctive queries
Journal of Computer and System Sciences
| Hi-index | 0.00 |
This paper is a study of weighted counting of the solutions of acyclic conjunctive queries (ACQ). The unweighted quantifier free version of this problem is known to be tractable (for combined complexity), but it is also known that introducing even a single quantified variable makes it #P-hard. We first show that weighted counting for quantifier free ACQ is still tractable and that even minimalistic extensions of the problem lead to hard cases. We then introduce a new parameter for quantified queries that permits to isolate a large island of tractability. We show that, up to a standard assumption from parameterized complexity, this parameter fully characterizes tractable subclasses for counting weighted solutions for ACQs. Thus we completely determine the tractability frontier for weighted counting for ACQ.