{"title":"SIGACT新闻复杂性理论专栏","authors":"L. Hemaspaandra","doi":"10.1145/3457588.3457597","DOIUrl":null,"url":null,"abstract":"Warmest thanks to Rafael Pass and Muthu Venkitasubramaniam for this issue's guest column, \"Average-Case Complexity Through the Lens of Interactive Puzzles.\" When I mentioned to them that my introduction would have a section on Alan Selman's passing, they immediately wrote back that they were very sorry to hear of Alan's passing, and mentioned (as you will see discussed in the second page of their article), \"The main problem that we are addressing actually goes back to a paper of Even, Selman, and Yacobi from 1984: \"The Complexity of Promise Problems with Applications to Public-Key Cryptography'.\" It is beautiful, and a tribute to the lasting influence of Alan's research, that in the 2020s his work from many decades earlier is helping shape the field's dialogue.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SIGACT News Complexity Theory Column 108\",\"authors\":\"L. Hemaspaandra\",\"doi\":\"10.1145/3457588.3457597\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Warmest thanks to Rafael Pass and Muthu Venkitasubramaniam for this issue's guest column, \\\"Average-Case Complexity Through the Lens of Interactive Puzzles.\\\" When I mentioned to them that my introduction would have a section on Alan Selman's passing, they immediately wrote back that they were very sorry to hear of Alan's passing, and mentioned (as you will see discussed in the second page of their article), \\\"The main problem that we are addressing actually goes back to a paper of Even, Selman, and Yacobi from 1984: \\\"The Complexity of Promise Problems with Applications to Public-Key Cryptography'.\\\" It is beautiful, and a tribute to the lasting influence of Alan's research, that in the 2020s his work from many decades earlier is helping shape the field's dialogue.\",\"PeriodicalId\":387985,\"journal\":{\"name\":\"ACM SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-03-16\",\"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/3457588.3457597\",\"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/3457588.3457597","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Warmest thanks to Rafael Pass and Muthu Venkitasubramaniam for this issue's guest column, "Average-Case Complexity Through the Lens of Interactive Puzzles." When I mentioned to them that my introduction would have a section on Alan Selman's passing, they immediately wrote back that they were very sorry to hear of Alan's passing, and mentioned (as you will see discussed in the second page of their article), "The main problem that we are addressing actually goes back to a paper of Even, Selman, and Yacobi from 1984: "The Complexity of Promise Problems with Applications to Public-Key Cryptography'." It is beautiful, and a tribute to the lasting influence of Alan's research, that in the 2020s his work from many decades earlier is helping shape the field's dialogue.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
