The Reachability Problem for Vector Addition Systems is Not Elementary
Wojciech Czerwiński
University of Warsaw
SWS Colloquium
Wojciech Czerwiński is an assistant professor (pol. adiunkt) at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw. His interests include automata and logic, more concretely infinite state systems and separability problems.
AG 1, AG 2, AG 3, INET, AG 4, AG 5, SWS, RG1, MMCI
I will present a recent non-elementary lower bound for the complexity of reachability problem for Vector Addition Systems. I plan to show the main insights of the proof. In particular I will present a surprising equation on fractions, which is the core of the new source of hardness found in VASes.