24 citations · 33 across the 12 of their papers we have counts for
1 paper · 1 filter
Stefan Göller, Markus Lohrey
We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(2^{2^{poly(n)}},O(n)). Providing a matching lower bound, we show that there…