56 citations · 231 across the 17 of their papers we have counts for
1 paper · 1 filter
Ranko Lazic
By adapting the iterative yardstick construction of Stockmeyer, we show that the reachability problem for vector addition systems with a stack does not have elementary complexity.…