%0 Journal Article %1 Blondin_2021 %A Blondin, Michael %A Raskin, Mikhail %D 2021 %I Centre pour la Communication Scientifique Directe (CCSD) %J Logical Methods in Computer Science %K conference %R 10.46298/lmcs-17(3:3)2021 %T The Complexity of Reachability in Affine Vector Addition Systems with States %U https://doi.org/10.46298%2Flmcs-17%283%3A3%292021 %V Volume 17, Issue 3

@article{Blondin_2021, added-at = {2022-11-16T21:08:19.000+0100}, author = {Blondin, Michael and Raskin, Mikhail}, biburl = {https://www.bibsonomy.org/bibtex/2454ddf60279a941ce3e544d04659f7dc/paves}, doi = {10.46298/lmcs-17(3:3)2021}, interhash = {14e459027e7e94ecb5e2afcf86d3fb4b}, intrahash = {454ddf60279a941ce3e544d04659f7dc}, journal = {Logical Methods in Computer Science}, keywords = {conference}, month = jul, publisher = {Centre pour la Communication Scientifique Directe ({CCSD})}, timestamp = {2023-09-24T18:53:09.000+0200}, title = {The Complexity of Reachability in Affine Vector Addition Systems with States}, url = {https://doi.org/10.46298%2Flmcs-17%283%3A3%292021}, volume = {Volume 17, Issue 3}, year = 2021 }