Michal Ajdarów, Antonín Kucera 0001. Deciding Polynomial Termination Complexity for VASS Programs. In Serge Haddad, Daniele Varacca, editors, 32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference. Volume 203 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]
@inproceedings{Ajdarow021, title = {Deciding Polynomial Termination Complexity for VASS Programs}, author = {Michal Ajdarów and Antonín Kucera 0001}, year = {2021}, doi = {10.4230/LIPIcs.CONCUR.2021.30}, url = {https://doi.org/10.4230/LIPIcs.CONCUR.2021.30}, researchr = {https://researchr.org/publication/Ajdarow021}, cites = {0}, citedby = {0}, booktitle = {32nd International Conference on Concurrency Theory, CONCUR 2021, August 24-27, 2021, Virtual Conference}, editor = {Serge Haddad and Daniele Varacca}, volume = {203}, series = {LIPIcs}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, isbn = {978-3-95977-203-7}, }