
Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS
Vector Addition Systems with States (VASS) provide a wellknown and fund...
read it

Efficient Algorithms for Checking Fast Termination in VASS
Vector Addition Systems with States (VASS) consists of a finite state sp...
read it

On the Complexity Landscape of Connected f Factor Problems
Let G be an undirected simple graph having n vertices and let f be a fun...
read it

Going Far From Degeneracy
An undirected graph G is ddegenerate if every subgraph of G has a verte...
read it

On the Complexity of SPEs in Parity Games
We study the complexity of problems related to subgameperfect equilibri...
read it

Games and Computational Complexity
Computers are known to solve a wide spectrum of problems, however not al...
read it

The Complexity of Tiling Problems
In this document, we collected the most important complexity results of ...
read it
Deciding Polynomial Termination Complexity for VASS Programs
We show that for every fixed k≥ 3, the problem whether the termination/counter complexity of a given demonic VASS is 𝒪(n^k), Ω(n^k), and Θ(n^k) is coNPcomplete, NPcomplete, and DPcomplete, respectively. We also classify the complexity of these problems for k≤ 2. This shows that the polynomialtime 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 PSPACEcomplete. Again, we classify the complexity also for k≤ 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.
READ FULL TEXT
Comments
There are no comments yet.