Reachability in 3-VASS is in Tower
Abstract
The reachability problem for vector addition systems with states (VASS) has been shown to be Ackermann-complete. For every k≥ 3, a completeness result for the k-dimensional VASS reachability problem is not yet available. It is shown in this paper that the 3-dimensional VASS reachability problem is in Tower, improving upon the current best upper bound F7 established by Leroux and Schmidt in 2019.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.