Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Deciding Polynomial Termination Complexity for VASS Programs   We show that for every fixed $k\geq 3$, the problem whether the
termination/counter complexity of a given demonic VASS is $\mathcal{O}(n^k)$,
$\Omega(n^{k})$, and $\Theta(n^{k})$ is coNP-complete, NP-complete, and
DP-complete, respectively. We also classify the complexity of these problems
for $k\leq 2$. This shows that the polynomial-time algorithm designed for
strongly connected demonic VASS in previous works cannot be extended to the
general case. Then, we prove that the same problems for VASS games are
PSPACE-complete. Again, we classify the complexity also for $k\leq 2$.
Interestingly, tractable subclasses of demonic VASS and VASS games are obtained
by bounding certain structural parameters, which opens the way to applications
in program analysis despite the presented lower complexity bounds.

5
The categories of this paper are: gr-qc
31
The categories of this paper are: ao-sci
35
The categories of this paper are: mtrl-th
25
The categories of this paper are: patt-sol
14
The categories of this paper are: math-ph
12
The categories of this paper are: nucl-th
37
The categories of this paper are: supr-con
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas
13
The categories of this paper are: quant-ph
3
The categories of this paper are: physics
18
The categories of this paper are: econ
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
26
The categories of this paper are: bayes-an