56 citations · 231 across the 17 of their papers we have counts for
1 paper · 1 filter
Ranko Lazić, Sylvain Schmitz
We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments an…