62 citations · 222 across the 34 of their papers we have counts for
50 papers
Counting in logarithmic space
Álvaro Gutiérrez, Christian Ikenmeyer, Greta Panova
We study the class of functions counting accepting paths of non-deterministic log-space Turing machines and construct methods to prove containment in .…
Which graph motif parameters count?
Markus Bläser, Radu Curticapean, Julian Dörfler +1
For a fixed graph H, the function #IndSub(H,*) maps graphs G to the count of induced H-copies in G; this function obviously "counts something" in that it has a combinatorial interp…
Algebraic metacomplexity and representation theory
Maxim van den Berg, Pranjal Dutta, Fulvio Gesmundo +2
In the algebraic metacomplexity framework we prove that the decomposition of metapolynomials into their isotypic components can be implemented efficiently, namely with only a quasi…
Functional Closure Properties of Finite -weighted Automata
Julian Dörfler, Christian Ikenmeyer
We determine all functional closure properties of finite -weighted automata, even all multivariate ones, and in particular all multivariate polynomials. We also determi…
Fixed-parameter debordering of Waring rank
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer +2
Border complexity measures are defined via limits (or topological closures), so that any function which can approximated arbitrarily closely by low complexity functions itself has…
Homogeneous Algebraic Complexity Theory and Algebraic Formulas
Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer +2
We study algebraic complexity classes and their complete polynomials under \emph{homogeneous linear} projections, not just under the usual affine linear projections that were origi…