9 citations · 16 across the 4 of their papers we have counts for
1 paper · 1 filter
Marius Bozga, Radu Iosif, Filip Konecny
This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling t…