{"title":"SIGACT 新闻 复杂性理论专栏 120","authors":"Ben Lee Volk","doi":"10.1145/3654780.3654787","DOIUrl":null,"url":null,"abstract":"Hamed Hatami and Pooya Hatami, our guest columnists in this issue, take us to a fascinating tour through communication complexity classes, and their relations to structural properties of Boolean matrices. Thanks a lot to Hamed and Pooya for their contribution!\n Coming up on the next issues, we will have columns by Pranjal Dutta and Sumanta Ghosh (on Polynomial identity testing), by Dean Doron (topic TBA), by Stacey Jeffrey (on Quantum Las Vegas Algorithms and Composition) and by Igor Carboni Oliveira (on Complexity Theory in Bounded Arithmetic: Recent Results and Current Frontiers). The future looks promising and exciting.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SIGACT News Complexity Theory Column 120\",\"authors\":\"Ben Lee Volk\",\"doi\":\"10.1145/3654780.3654787\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hamed Hatami and Pooya Hatami, our guest columnists in this issue, take us to a fascinating tour through communication complexity classes, and their relations to structural properties of Boolean matrices. Thanks a lot to Hamed and Pooya for their contribution!\\n Coming up on the next issues, we will have columns by Pranjal Dutta and Sumanta Ghosh (on Polynomial identity testing), by Dean Doron (topic TBA), by Stacey Jeffrey (on Quantum Las Vegas Algorithms and Composition) and by Igor Carboni Oliveira (on Complexity Theory in Bounded Arithmetic: Recent Results and Current Frontiers). The future looks promising and exciting.\",\"PeriodicalId\":387985,\"journal\":{\"name\":\"ACM SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-26\",\"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/3654780.3654787\",\"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/3654780.3654787","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hamed Hatami and Pooya Hatami, our guest columnists in this issue, take us to a fascinating tour through communication complexity classes, and their relations to structural properties of Boolean matrices. Thanks a lot to Hamed and Pooya for their contribution!
Coming up on the next issues, we will have columns by Pranjal Dutta and Sumanta Ghosh (on Polynomial identity testing), by Dean Doron (topic TBA), by Stacey Jeffrey (on Quantum Las Vegas Algorithms and Composition) and by Igor Carboni Oliveira (on Complexity Theory in Bounded Arithmetic: Recent Results and Current Frontiers). The future looks promising and exciting.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
