sharedCharging
- 期刊名称Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
- 作者Wang, Guang; Li, Wenzhong; Zhang, Jun; Ge, Yingqiang; Fu, Zuohui; Zhang, Fan; Wang, Yang; Zhang, Desheng
- 卷第3卷
- 期第3期
- 电子ISSN2474-9567
- 文件大小10341.70KB
- 发表时间2019-09-09
- DOI10.1145/3351266
- 页码1-25
[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - Fooling polytopesO'Donnell, Ryan; Servedio, Rocco A.; Tan, Li-Yang · 2019
[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - Testing unateness nearly optimallyChen, Xi; Waingarten, Erik · 2019
[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - DNF sparsification beyond sunflowersLovett, Shachar; Zhang, Jiapeng · 2019
[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - Quantum state certificationBădescu, Costin; O'Donnell, Ryan; Wright, John · 2019
[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - Regression from dependent observationsDaskalakis, Constantinos; Dikkala, Nishanth; Panageas, Ioannis · 2019
[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - Separating monotone VP and VNPYehudayoff, Amir · 2019
[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - Private selection from private candidatesLiu, Jingcheng; Talwar, Kunal · 2019
[ACM Press the 51st Annual ACM SIGACT Symposium - Phoenix, AZ, USA (2019.06.23-2019.06.26)] Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 - Planar diameter via metric compressionLi, Jason; Parter, Merav · 2019
Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower BoundKomargodski, Ilan; Raz, Ran; Tal, Avishay · SIAM Journal on Computing · 2017
[ACM Press the 49th Annual ACM SIGACT Symposium - Montreal, Canada (2017.06.19-2017.06.23)] Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2017 - Time-space hardness of learning sparse paritiesKol, Gillat; Raz, Ran; Tal, Avishay · 2017
[IEEE 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA, USA (2013.10.26-2013.10.29)] 2013 IEEE 54th Annual Symposium on Foundations of Computer Science - Improved Average-Case Lower Bounds for DeMorgan Formula SizeKomargodski, Ilan; Raz, Ran; Tal, Avishay · 2013
[ACM Press the 50th Annual ACM SIGACT Symposium - Los Angeles, CA, USA (2018.06.25-2018.06.29)] Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2018 - Extractor-based time-space lower bounds for learningGarg, Sumegha; Raz, Ran; Tal, Avishay · 2018