%0 Conference Paper %1 conf/concur/Ajdarow021 %A Ajdarów, Michal %A Kucera, Antonín %B CONCUR %D 2021 %E Haddad, Serge %E Varacca, Daniele %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 30:1-30:15 %T Deciding Polynomial Termination Complexity for VASS Programs. %U http://dblp.uni-trier.de/db/conf/concur/concur2021.html#Ajdarow021 %V 203 %@ 978-3-95977-203-7

@inproceedings{conf/concur/Ajdarow021, added-at = {2024-10-06T00:00:00.000+0200}, author = {Ajdarów, Michal and Kucera, Antonín}, biburl = {https://www.bibsonomy.org/bibtex/20adff1471e17574d73a8e0c135af827b/dblp}, booktitle = {CONCUR}, crossref = {conf/concur/2021}, editor = {Haddad, Serge and Varacca, Daniele}, ee = {https://doi.org/10.4230/LIPIcs.CONCUR.2021.30}, interhash = {f661f9bb7fed9befd7c4c225709916ee}, intrahash = {0adff1471e17574d73a8e0c135af827b}, isbn = {978-3-95977-203-7}, keywords = {dblp}, pages = {30:1-30:15}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-10-07T09:28:40.000+0200}, title = {Deciding Polynomial Termination Complexity for VASS Programs.}, url = {http://dblp.uni-trier.de/db/conf/concur/concur2021.html#Ajdarow021}, volume = 203, year = 2021 }