{"title":"Technical Report Column","authors":"D. Kelley","doi":"10.1145/3232679.3232685","DOIUrl":null,"url":null,"abstract":"Complexity Theory, Game Theory, and Economics, Tim Roughgarden, TR18-001. Which Distribution Distances are Sublinearly Testable?, Constantinos Daskalakis, Gautam Kamath, John Wright, TR18-002. Proving that prBPP = prP is as hard as \\almost\" proving that P 6= NP, Roei Tell, TR18-003. Circuit Complexity of Bounded Planar Cutwidth Graph Matching, Aayush Ojha, Raghunath Tewari, TR18-004. Adaptive Boolean Monotonicity Testing in Total In uence Time, C. Seshadhri, Deeparnab Chakrabarty, TR18-005. Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion, Subhash Khot, Dor Minzer, Muli Safra, TR18-006.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":"33 1","pages":"18-28"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3232679.3232685","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Complexity Theory, Game Theory, and Economics, Tim Roughgarden, TR18-001. Which Distribution Distances are Sublinearly Testable?, Constantinos Daskalakis, Gautam Kamath, John Wright, TR18-002. Proving that prBPP = prP is as hard as \almost" proving that P 6= NP, Roei Tell, TR18-003. Circuit Complexity of Bounded Planar Cutwidth Graph Matching, Aayush Ojha, Raghunath Tewari, TR18-004. Adaptive Boolean Monotonicity Testing in Total In uence Time, C. Seshadhri, Deeparnab Chakrabarty, TR18-005. Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion, Subhash Khot, Dor Minzer, Muli Safra, TR18-006.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
