SIGACT新闻复杂性理论专栏

L. Hemaspaandra
{"title":"SIGACT新闻复杂性理论专栏","authors":"L. Hemaspaandra","doi":"10.1145/3471469.3471478","DOIUrl":null,"url":null,"abstract":"Warmest thanks to Alexander Knop, Shachar Lovett, Sam McGuire, and Weiqiang Yuan for this issue's guest column, \\Models of computation between decision trees and communication.\" (Their article came in early, and I wrote back thanking them for being three days early, mentioning that that happens surprisingly rarely. Then two days later, I said, \\Wow!\", as I realized that they actually had somehow|even during a remote-teaching, social-distancing time period|prepared and sent in their article a month and three days early.)","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SIGACT News Complexity Theory Column 109\",\"authors\":\"L. Hemaspaandra\",\"doi\":\"10.1145/3471469.3471478\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Warmest thanks to Alexander Knop, Shachar Lovett, Sam McGuire, and Weiqiang Yuan for this issue's guest column, \\\\Models of computation between decision trees and communication.\\\" (Their article came in early, and I wrote back thanking them for being three days early, mentioning that that happens surprisingly rarely. Then two days later, I said, \\\\Wow!\\\", as I realized that they actually had somehow|even during a remote-teaching, social-distancing time period|prepared and sent in their article a month and three days early.)\",\"PeriodicalId\":387985,\"journal\":{\"name\":\"ACM SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3471469.3471478\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3471469.3471478","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

热烈感谢Alexander Knop, Shachar Lovett, Sam McGuire和Weiqiang Yuan为本期客座专栏“决策树与通信之间的计算模型”。(他们的文章很早就寄来了,我回信感谢他们提前三天到达,并提到这种情况非常罕见。两天后,我惊呼:“哇!”,因为我意识到,即使是在远程教学、保持社交距离的时期,他们实际上也以某种方式提前一个月零三天准备好了他们的文章。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SIGACT News Complexity Theory Column 109
Warmest thanks to Alexander Knop, Shachar Lovett, Sam McGuire, and Weiqiang Yuan for this issue's guest column, \Models of computation between decision trees and communication." (Their article came in early, and I wrote back thanking them for being three days early, mentioning that that happens surprisingly rarely. Then two days later, I said, \Wow!", as I realized that they actually had somehow|even during a remote-teaching, social-distancing time period|prepared and sent in their article a month and three days early.)
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信