Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/lmcs/BlondinR21
%A Blondin, Michael
%A Raskin, Mikhail A.
%D 2021
%J Log. Methods Comput. Sci.
%K dblp
%N 3
%T The Complexity of Reachability in Affine Vector Addition Systems with States.
%U http://dblp.uni-trier.de/db/journals/lmcs/lmcs17.html#BlondinR21
%V 17
@article{journals/lmcs/BlondinR21,
added-at = {2023-01-24T00:00:00.000+0100},
author = {Blondin, Michael and Raskin, Mikhail A.},
biburl = {https://www.bibsonomy.org/bibtex/2b73f6c3367cb32e688d1d4a9cfd9d5e1/dblp},
ee = {https://doi.org/10.46298/lmcs-17(3:3)2021},
interhash = {14e459027e7e94ecb5e2afcf86d3fb4b},
intrahash = {b73f6c3367cb32e688d1d4a9cfd9d5e1},
journal = {Log. Methods Comput. Sci.},
keywords = {dblp},
number = 3,
timestamp = {2024-04-09T01:50:46.000+0200},
title = {The Complexity of Reachability in Affine Vector Addition Systems with States.},
url = {http://dblp.uni-trier.de/db/journals/lmcs/lmcs17.html#BlondinR21},
volume = 17,
year = 2021
}