12 citations · 13 across the 3 of their papers we have counts for
3 papers
cs.LO2013★ 12 cited
Structural Tractability of Counting of Solutions to Conjunctive Queries
Arnaud Durand, Stefan Mengel
In this paper we explore the problem of counting solutions to conjunctive queries. We consider a parameter called the \emph{quantified star size} of a formula which measures ho…
cs.CC2013★ 1 cited
Arithmetic Branching Programs with Memory
Stefan Mengel
We extend the well known characterization of $\vpws$ as the class of polynomials computed by polynomial size arithmetic branching programs to other complexity classes. In order to…
cs.CC2012
The arithmetic complexity of tensor contractions
Florent Capelli, Arnaud Durand, Stefan Mengel
We investigate the algebraic complexity of tensor calulus. We consider a generalization of iterated matrix product to tensors and show that the resulting formulas exactly capture V…