特邀文章前言

Journal of the ACM (JACM) Pub Date : 2018-11-22 DOI:10.1145/3241947

É. Tardos

{"title":"特邀文章前言","authors":"É. Tardos","doi":"10.1145/3241947","DOIUrl":null,"url":null,"abstract":"The Invited Article section of this issue consists of the article, “Settling the query complexity of non-adaptive junta testing,” by Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, and Jinyu Xie, which won the best paper award at the 2017 Computational Complexity Conference (CCC’17). We want to thank the CCC’17 Program Committee and the PC chair Ryan O’Donnell for their help in selecting this invited article, and editor Irit Dinur for handling the article.","PeriodicalId":17199,"journal":{"name":"Journal of the ACM (JACM)","volume":"73 1","pages":"1 - 1"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Invited Article Foreword\",\"authors\":\"É. Tardos\",\"doi\":\"10.1145/3241947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Invited Article section of this issue consists of the article, “Settling the query complexity of non-adaptive junta testing,” by Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, and Jinyu Xie, which won the best paper award at the 2017 Computational Complexity Conference (CCC’17). We want to thank the CCC’17 Program Committee and the PC chair Ryan O’Donnell for their help in selecting this invited article, and editor Irit Dinur for handling the article.\",\"PeriodicalId\":17199,\"journal\":{\"name\":\"Journal of the ACM (JACM)\",\"volume\":\"73 1\",\"pages\":\"1 - 1\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-22\",\"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/3241947\",\"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/3241947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文由陈曦、Rocco A. Servedio、Tan Li-Yang、Erik Waingarten、Jinyu Xie撰写的文章“解决非自适应团测试的查询复杂性”获得2017年计算复杂性会议(CCC ' 17)最佳论文奖。我们要感谢CCC ' 17项目委员会和PC主席Ryan O ' donnell在选择这篇特邀文章时的帮助，以及编辑Irit Dinur对这篇文章的处理。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Invited Article Foreword

The Invited Article section of this issue consists of the article, “Settling the query complexity of non-adaptive junta testing,” by Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, and Jinyu Xie, which won the best paper award at the 2017 Computational Complexity Conference (CCC’17). We want to thank the CCC’17 Program Committee and the PC chair Ryan O’Donnell for their help in selecting this invited article, and editor Irit Dinur for handling the article.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of the ACM (JACM)

自引率

0.00%

发文量