{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:18:50Z","timestamp":1760080730635,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["950398"],"award-info":[{"award-number":["950398"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,2]]},"DOI":"10.1145\/3531130.3533357","type":"proceedings-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T20:23:38Z","timestamp":1659644618000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes"],"prefix":"10.1145","author":[{"given":"Wojciech","family":"Czerwinski","sequence":"first","affiliation":[{"name":"University of Warsaw, Poland"}]},{"given":"Lukasz","family":"Orlikowski","sequence":"additional","affiliation":[{"name":"University of Warsaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3464794"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.14"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72013-1_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316369"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of CONCUR","author":"Czerwinski Wojciech","year":"2020","unstructured":"Wojciech Czerwinski , Slawomir Lasota , Ranko Lazic , J\u00e9r\u00f4me Leroux , and Filip Mazowiecki . 2020 . Reachability in Fixed Dimension Vector Addition Systems with States . In Proceedings of CONCUR 2020. 48:1\u201348:21. Wojciech Czerwinski, Slawomir Lasota, Ranko Lazic, J\u00e9r\u00f4me Leroux, and Filip Mazowiecki. 2020. Reachability in Fixed Dimension Vector Addition Systems with States. In Proceedings of CONCUR 2020. 48:1\u201348:21."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of FOCS","author":"Czerwinski Wojciech","year":"2021","unstructured":"Wojciech Czerwinski and Lukasz Orlikowski . 2021 . Reachability in Vector Addition Systems is Ackermann-complete . In Proceedings of FOCS 2021. IEEE, 1229\u20131240. Wojciech Czerwinski and Lukasz Orlikowski. 2021. Reachability in Vector Addition Systems is Ackermann-complete. In Proceedings of FOCS 2021. IEEE, 1229\u20131240."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Wojciech Czerwinski and Lukasz Orlikowski. 2021. Reachability in Vector Addition Systems is Ackermann-complete. CoRR abs\/2104.13866(2021).  Wojciech Czerwinski and Lukasz Orlikowski. 2021. Reachability in Vector Addition Systems is Ackermann-complete. CoRR abs\/2104.13866(2021).","DOI":"10.1109\/FOCS52979.2021.00120"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Wojciech Czerwinski and Lukasz Orlikowski. 2022. Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. CoRR abs\/2203.04243(2022).  Wojciech Czerwinski and Lukasz Orlikowski. 2022. Lower Bounds for the Reachability Problem in Fixed Dimensional VASSes. CoRR abs\/2203.04243(2022).","DOI":"10.1145\/3531130.3533357"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45190-5_22"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933577"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01694011"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_25"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of STACS 2022(LIPIcs, Vol.\u00a0219)","author":"Lasota Slawomir","year":"2022","unstructured":"Slawomir Lasota . 2022 . Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem . In Proceedings of STACS 2022(LIPIcs, Vol.\u00a0219) . 46:1\u201346:15. Slawomir Lasota. 2022. Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem. In Proceedings of STACS 2022(LIPIcs, Vol.\u00a0219). 46:1\u201346:15."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of FOCS","author":"Leroux J\u00e9r\u00f4me","year":"2021","unstructured":"J\u00e9r\u00f4me Leroux . 2021 . The Reachability Problem for Petri Nets is Not Primitive Recursive . In Proceedings of FOCS 2021. IEEE, 1241\u20131252. J\u00e9r\u00f4me Leroux. 2021. The Reachability Problem for Petri Nets is Not Primitive Recursive. In Proceedings of FOCS 2021. IEEE, 1241\u20131252."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"J\u00e9r\u00f4me Leroux. 2021. The Reachability Problem for Petri Nets is Not Primitive Recursive. CoRR abs\/2104.12695(2021).  J\u00e9r\u00f4me Leroux. 2021. The Reachability Problem for Petri Nets is Not Primitive Recursive. CoRR abs\/2104.12695(2021).","DOI":"10.1109\/FOCS52979.2021.00121"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785796"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28644-8_26"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802477"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2858784"}],"event":{"name":"LICS '22: 37th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation"],"location":"Haifa Israel","acronym":"LICS '22"},"container-title":["Proceedings of the 37th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533357","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3531130.3533357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:10Z","timestamp":1750186930000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3531130.3533357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,2]]},"references-count":19,"alternative-id":["10.1145\/3531130.3533357","10.1145\/3531130"],"URL":"https:\/\/doi.org\/10.1145\/3531130.3533357","relation":{},"subject":[],"published":{"date-parts":[[2022,8,2]]},"assertion":[{"value":"2022-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}