SIAM Journal on Computing, Volume 49, Issue 4, Page FOCS17-i-FOCS17-i, January 2020.
This special section comprises nine fully refereed papers whose extended abstracts were presented at the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017) in Berkeley, California, on October 15--17, 2017. The preliminary conference versions of these papers were published by in the FOCS 2017 proceedings. The regular conference program consisted of 90 papers chosen from among 323 submissions. They were selected by a program committee consisting of Aditya Bhaskara, Andrej Bogdanov, Vladimir Braverman, Shiri Chechik, Gil Cohen, Anindya De, Ankit Garg, Josh Grochow, Sean Hallgren, Valentine Kabanets, Gillat Kol, Ravi Kumar, Chris Peikert, Sofya Raskhodnikova, Rahul Santhanam, Yaron Singer, Chaitanya Swamy, Amnon Ta-Shma, Chris Umans (chair), Vinod Vaikuntanathan, Emanuele Viola, Omri Weinstein, and Amir Yehudayoff. The papers invited to this special section were also chosen with the input of the program committee. The nine papers in this section span a broad range of topics, including cryptography, approximation algorithms, hardness of approximation, complexity theory, communication complexity, graph sparsification, and error-correcting codes. Each paper underwent an extensive refereeing process. We thank the authors and the anonymous referees for their efforts. In addition, we would like to thank SICOMP Editors-in-Chief Leonard Schulman and Robert Krauthgamer and SIAM Senior Publications Coordinator Heather Blythe for their help in preparing this special section.

中文翻译：

---

IEEE第58届年度计算机科学基础专题研讨会特别部分（FOCS 2017）

SIAM计算杂志，第49卷，第4期，第FOCS17-i-FOCS17-i页，2020年1月。
本专题包含9篇经过充分参考的论文，其扩展摘要在2017年10月15日至17日在加利福尼亚州伯克利举行的第58届IEEE计算机科学基础年度研讨会上发表（FOCS 2017）。由FOCS 2017会议记录发布。例行会议计划由323份论文中的90篇论文组成。他们由一个程序委员会选拔，该委员会由Aditya Bhaskara，Andrej Bogdanov，Vladimir Braverman，Shiri Chechik，Gil Cohen，Anindya De，Ankit Garg，Josh Grochow，Sean Hallgren，Valentine Kabanets，Gillat Kol，Ravi Kumar，Chris Peikert，Sofya Raskhodnikova组成，Rahul Santhanam，Yaron Singer，Chaitanya Swamy，Amnon Ta-Shma，Chris Umans（主席），Vinod Vaikuntanathan，Emanuele Viola，Omri Weinstein和Amir Yehudayoff。在计划委员会的投入下，也选择了邀请参加本节的论文。本节中的九篇论文涵盖了广泛的主题，包括密码学，近似算法，近似硬度，复杂性理论，通信复杂性，图稀疏度和纠错码。每篇论文都经过了广泛的裁判程序。我们感谢作者和匿名裁判的努力。此外，我们还要感谢SICOMP主编Leonard Schulman和Robert Krauthgamer以及SIAM高级出版物协调员Heather Blythe在准备本节时所提供的帮助。近似算法，近似硬度，复杂度理论，通信复杂度，图稀疏度和纠错码。每篇论文都经过了广泛的裁判程序。我们感谢作者和匿名裁判的努力。此外，我们还要感谢SICOMP主编Leonard Schulman和Robert Krauthgamer以及SIAM高级出版物协调员Heather Blythe在准备本节时所提供的帮助。近似算法，近似硬度，复杂度理论，通信复杂度，图稀疏度和纠错码。每篇论文都经过了广泛的裁判程序。我们感谢作者和匿名裁判的努力。此外，我们还要感谢SICOMP主编Leonard Schulman和Robert Krauthgamer以及SIAM高级出版物协调员Heather Blythe在准备本节时所提供的帮助。