Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes
Abstract
We study the complexity of the reachability problem for Vector Addition Systems with States (VASSes) in fixed dimensions. We provide four lower bounds improving the currently known state-of-the-art: 1) -hardness for unary flat 4-VASSes (VASSes in dimension 4), 2) -hardness for unary 5-VASSes, 3) -hardness for binary 6-VASSes and 4) -hardness for unary 8-VASSes.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.