{"title":"特邀文章前言","authors":"É. Tardos","doi":"10.1145/3328536","DOIUrl":null,"url":null,"abstract":"The Invited Articles section of this issue consists of three papers. The first is “Shellability is NPcomplete,” by Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner, which won the best-paper award at the 34th International Symposium on Computational Geometry (SoCG’17). We want to thank the SoGS Program Committee for their help in selecting this invited paper and editor Jean-Daniel Boissonnat for handling the paper. Next is “Towards Verifying Nonlinear Integer Arithmetic,” by Paul Beame and Vincent Liew, invited from the 39th International Conference on Computer Aided Verification (CAV’17). We want to thank the CAV Program Committee for their help in selecting this invited paper and editor Rajeev Alur for handling the paper. Last, but not least, is the paper “On the Computability of Conditional Probability,” by Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy, invited from the 26th Annual IEEE Symposium on Logic in Computer Science (LICS’11). We want to thank the LICS Program Committee for their help in selecting this invited paper and editor Nachum Dershowitz for handling the paper.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"220 1","pages":"1 - 1"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Invited Articles Foreword\",\"authors\":\"É. Tardos\",\"doi\":\"10.1145/3328536\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Invited Articles section of this issue consists of three papers. The first is “Shellability is NPcomplete,” by Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner, which won the best-paper award at the 34th International Symposium on Computational Geometry (SoCG’17). We want to thank the SoGS Program Committee for their help in selecting this invited paper and editor Jean-Daniel Boissonnat for handling the paper. Next is “Towards Verifying Nonlinear Integer Arithmetic,” by Paul Beame and Vincent Liew, invited from the 39th International Conference on Computer Aided Verification (CAV’17). We want to thank the CAV Program Committee for their help in selecting this invited paper and editor Rajeev Alur for handling the paper. Last, but not least, is the paper “On the Computability of Conditional Probability,” by Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy, invited from the 26th Annual IEEE Symposium on Logic in Computer Science (LICS’11). We want to thank the LICS Program Committee for their help in selecting this invited paper and editor Nachum Dershowitz for handling the paper.\",\"PeriodicalId\":17199,\"journal\":{\"name\":\"Journal of the ACM (JACM)\",\"volume\":\"220 1\",\"pages\":\"1 - 1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-29\",\"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/3328536\",\"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/3328536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
本期特邀文章部分由三篇论文组成。第一个是“Shellability is NPcomplete”,作者是Xavier Goaoc、Pavel Paták、Zuzana Patáková、Martin Tancer和Uli Wagner,该论文在第34届国际计算几何研讨会(SoCG ' 17)上获得了最佳论文奖。我们要感谢SoGS项目委员会在选择这篇受邀论文方面的帮助,以及编辑Jean-Daniel Boissonnat对论文的处理。接下来是Paul Beame和Vincent Liew从第39届计算机辅助验证国际会议(CAV ' 17)邀请的“迈向验证非线性整数算法”。我们要感谢CAV项目委员会帮助我们选择这篇受邀论文,并感谢编辑Rajeev Alur处理这篇论文。最后,但并非最不重要的是Nathanael L. Ackerman, Cameron E. Freer和Daniel M. Roy在第26届IEEE计算机科学逻辑研讨会(LICS ' 11)上发表的论文“On the Computability of Conditional Probability”。我们要感谢LICS项目委员会在选择这篇受邀论文方面的帮助,以及编辑Nachum Dershowitz对论文的处理。
The Invited Articles section of this issue consists of three papers. The first is “Shellability is NPcomplete,” by Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner, which won the best-paper award at the 34th International Symposium on Computational Geometry (SoCG’17). We want to thank the SoGS Program Committee for their help in selecting this invited paper and editor Jean-Daniel Boissonnat for handling the paper. Next is “Towards Verifying Nonlinear Integer Arithmetic,” by Paul Beame and Vincent Liew, invited from the 39th International Conference on Computer Aided Verification (CAV’17). We want to thank the CAV Program Committee for their help in selecting this invited paper and editor Rajeev Alur for handling the paper. Last, but not least, is the paper “On the Computability of Conditional Probability,” by Nathanael L. Ackerman, Cameron E. Freer, and Daniel M. Roy, invited from the 26th Annual IEEE Symposium on Logic in Computer Science (LICS’11). We want to thank the LICS Program Committee for their help in selecting this invited paper and editor Nachum Dershowitz for handling the paper.