{"title":"技术报告专栏","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":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":null,\"pages\":null},\"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}","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
摘要
复杂性理论，博弈论和经济学，蒂姆·拉夫加登，TR18-001。哪些分布距离是次线性可测试的?， Constantinos Daskalakis, Gautam Kamath, John Wright, TR18-002。证明prBPP = prP和“几乎”证明p6 = NP一样难，Roei Tell, TR18-003。张建军，张建军，张建军，等。一种有界平面宽度图匹配的电路复杂度。李建军，张建军，李建军，等。基于自适应布尔单调性的全时间序列测试。Grassmann图中的伪随机集具有近完美展开，Subhash Khot, Dor Minzer, Muli Safra, TR18-006。
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
分享
求助内容：
应助结果提醒方式：
扫码关注我们
