Reachability in fixed VASS: expressiveness and lower bounds
type: Item
instance of: scholarly article
title: Reachability in fixed VASS: expressiveness and lower bounds
DOI: 10.1007/978-3-031-57231-9_9
author: Andrei Draghici
author: Christoph Haase
author: Andrew Ryzhikov
publication date: 2024-10-30T00:00:00Z
Mathematics Subject Classification ID: 68Nxx
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7935765
MaRDI profile type: Publication
cites work: On the Complexity of Numerical Analysis
cites work: Computational Complexity
cites work: On uniformity within \(NC^ 1\)
cites work: The Reachability Problem for Petri Nets Is Not Elementary
cites work: Rudimentary relations and primitive recursion: A toolbox
cites work: Counter machines and counter languages
cites work: The Hardest Context-Free Language
cites work: Remarks on the complexity of nondeterministic counter languages
cites work: Demystifying Reachability in Vector Addition Systems
cites work: An Algorithm for the General Petri Net Reachability Problem
cites work: Q5590814
cites work: Short Presburger Arithmetic Is Hard
cites work: A multiparameter analysis of the boundedness problem for vector addition systems
cites work: A hardest language recognized by two-way nondeterministic pushdown automata
cites work: Arithmetic, first-order logic, and counting quantifiers
cites work: The complexity of almost linear diophantine problems
description: scientific article; zbMATH DE number 7935765