Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Reachability for Bounded Branching VASS   In this paper we consider the reachability problem for bounded branching
VASS. Bounded VASS are a variant of the classic VASS model where all values in
all configurations are upper bounded by a fixed natural number, encoded in
binary in the input. This model gained a lot of attention in 2012 when Haase et
al. showed its connections with timed automata. Later in 2013 Fearnley and
Jurdzi\'{n}ski proved that the reachability problem in this model is
PSPACE-complete even in dimension 1. Here, we investigate the complexity of the
reachability problem when the model is extended with branching transitions, and
we prove that the problem is EXPTIME-complete when the dimension is 2 or
larger.

12
The categories of this paper are: nucl-th
26
The categories of this paper are: bayes-an
13
The categories of this paper are: quant-ph
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
10
The categories of this paper are: q-bio
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
0
The categories of this paper are: hep-ph
4
The categories of this paper are: cond-mat
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph