AI Chat AI Image Generator AI Video Text to Speech

Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes

03/08/2022

∙

by Wojciech Czerwiński, et al.

∙

∙

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.

Wojciech Czerwiński
11 publications
Łukasz Orlikowski
2 publications

page 1

page 2

page 3

page 4

research

∙ 05/18/2021

Improved Ackermannian lower bound for the VASS reachability problem

This draft is a follow-up of the Ackermannian lower bound for the reacha...

0 Sławomir Lasota, et al. ∙

research

∙ 05/19/2022

The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics

Many high-dimensional statistical inference problems are believed to pos...

0 Afonso S. Bandeira, et al. ∙

research

∙ 05/20/2018

Minimax Lower Bounds for Cost Sensitive Classification

The cost-sensitive classification problem plays a crucial role in missio...

0 Parameswaran Kamalaruban, et al. ∙

research

∙ 07/10/2020

On flat lossy channel machines

We show that reachability, repeated reachability, nontermination and unb...

0 Philippe Schnoebelen, et al. ∙

research

∙ 03/15/2022

Reachability In Simple Neural Networks

We investigate the complexity of the reachability problem for (deep) neu...

0 Marco Sälzer, et al. ∙

research

∙ 08/21/2018

Group Activity Selection with Few Agent Types

The Group Activity Selection Problem (GASP) models situations where a gr...

0 Robert Ganian, et al. ∙

research

∙ 01/03/2018

EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets

We note that the remarkable EXPSPACE-hardness result in [Göller, Haase, ...

0 Petr Jancar, et al. ∙