22 citations · 90 across the 29 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011
Monomials in arithmetic circuits: Complete problems in the counting hierarchy
Hervé Fournier, Guillaume Malod, Stefan Mengel
We consider the complexity of two questions on polynomials given by arithmetic circuits: testing whether a monomial is present and counting the number of monomials. We show that th…
cs.CC2011★ 3 cited
The Complexity of Weighted Counting for Acyclic Conjunctive Queries
Arnaud Durand, Stefan Mengel
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…