{"title":"特邀文章前言","authors":"É. Tardos","doi":"10.1145/3442687","DOIUrl":null,"url":null,"abstract":"The Invited Article section of this issue includes “The Reachability Problem for Petri Nets Is Not Elementary,” by Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Flip Mazowiecki, which won the best paper award at the 51st Annual ACM Symposium on the Theory of Computing (STOC’19). We thank the STOC’19 Program Committee for their help in selecting this invited article, and we thank editor Martin Grohe for handling this article.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Invited Article Foreword\",\"authors\":\"É. Tardos\",\"doi\":\"10.1145/3442687\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Invited Article section of this issue includes “The Reachability Problem for Petri Nets Is Not Elementary,” by Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Flip Mazowiecki, which won the best paper award at the 51st Annual ACM Symposium on the Theory of Computing (STOC’19). We thank the STOC’19 Program Committee for their help in selecting this invited article, and we thank editor Martin Grohe for handling this article.\",\"PeriodicalId\":17199,\"journal\":{\"name\":\"Journal of the ACM (JACM)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of the ACM (JACM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3442687\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of the ACM (JACM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3442687","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Invited Article section of this issue includes “The Reachability Problem for Petri Nets Is Not Elementary,” by Wojciech Czerwiński, Sławomir Lasota, Ranko Lazić, Jérôme Leroux, and Flip Mazowiecki, which won the best paper award at the 51st Annual ACM Symposium on the Theory of Computing (STOC’19). We thank the STOC’19 Program Committee for their help in selecting this invited article, and we thank editor Martin Grohe for handling this article.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
