{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T13:03:28Z","timestamp":1768914208115,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":67,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100014718","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1849899"],"award-info":[{"award-number":["1849899"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384339","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"1184-1197","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Extractors for adversarial sources via extremal hypergraphs"],"prefix":"10.1145","author":[{"given":"Eshan","family":"Chattopadhyay","sequence":"first","affiliation":[{"name":"Cornell University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesse","family":"Goodman","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vipul","family":"Goyal","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Li","sequence":"additional","affiliation":[{"name":"Johns Hopkins University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"geometric expanders, sorting in rounds, and ramsey theory. Combinatorica, 6 ( 3 ): 207-219","author":"Alon Noga","year":"1986","unstructured":"[Alo86] Noga Alon . Eigenvalues , geometric expanders, sorting in rounds, and ramsey theory. Combinatorica, 6 ( 3 ): 207-219 , 1986 . [Alo86] Noga Alon. Eigenvalues, geometric expanders, sorting in rounds, and ramsey theory. Combinatorica, 6 ( 3 ): 207-219, 1986."},{"key":"e_1_3_2_1_3_1","unstructured":"[BACDTS19] Avraham Ben-Aroya Gil Cohen Dean Doron and Amnon Ta-Shma.  [BACDTS19] Avraham Ben-Aroya Gil Cohen Dean Doron and Amnon Ta-Shma."},{"key":"e_1_3_2_1_4_1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik","year":"2019","unstructured":"Two-source condensers with low error and small entropy gap via entropy-resilient functions. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik , 2019 . Two-source condensers with low error and small entropy gap via entropy-resilient functions. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055423"},{"key":"e_1_3_2_1_6_1","volume-title":"Near-optimal strong dispersers, erasure list-decodable codes and friends. Electronic Colloquium on Computational Complexity (ECCC), 25 : 65","author":"Ben-Aroya Avraham","year":"2018","unstructured":"[BDT18] Avraham Ben-Aroya , Dean Doron , and Amnon Ta-Shma . Near-optimal strong dispersers, erasure list-decodable codes and friends. Electronic Colloquium on Computational Complexity (ECCC), 25 : 65 , 2018 . [BDT18] Avraham Ben-Aroya, Dean Doron, and Amnon Ta-Shma. Near-optimal strong dispersers, erasure list-decodable codes and friends. Electronic Colloquium on Computational Complexity (ECCC), 25 : 65, 2018."},{"key":"e_1_3_2_1_7_1","volume-title":"Randomness extraction from somewhat dependent sources","author":"Ball Marshall","year":"2020","unstructured":"[BGM20] Marshall Ball , Oded Goldreich , and Tal Malkin . Randomness extraction from somewhat dependent sources . 2020 . [BGM20] Marshall Ball, Oded Goldreich, and Tal Malkin. Randomness extraction from somewhat dependent sources. 2020."},{"key":"e_1_3_2_1_8_1","first-page":"1095","volume":"36","author":"Barak Boaz","unstructured":"[BIW06] Boaz Barak , Russell Impagliazzo , and Avi Wigderson . Extracting randomness using few independent sources. SIAM Journal on Computing , 36 ( 4 ): 1095 - 1118 , 2006. [BIW06] Boaz Barak, Russell Impagliazzo, and Avi Wigderson. Extracting randomness using few independent sources. SIAM Journal on Computing, 36 ( 4 ): 1095-1118, 2006.","journal-title":"Computing"},{"key":"e_1_3_2_1_9_1","first-page":"1","volume-title":"Proceedings of the thirtyseventh annual ACM symposium on Theory of computing","author":"Barak Boaz","unstructured":"[BKS+05] Boaz Barak , Guy Kindler , Ronen Shaltiel , Benny Sudakov , and Avi Wigderson . Simulating independence : New constructions of condensers, ramsey graphs, dispersers, and extractors . In Proceedings of the thirtyseventh annual ACM symposium on Theory of computing , pages 1 - 10 . [BKS+05] Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sudakov, and Avi Wigderson. Simulating independence: New constructions of condensers, ramsey graphs, dispersers, and extractors. In Proceedings of the thirtyseventh annual ACM symposium on Theory of computing, pages 1-10."},{"key":"e_1_3_2_1_10_1","unstructured":"ACM 2005.  ACM 2005."},{"key":"e_1_3_2_1_11_1","first-page":"1","volume":"01","author":"Bourgain J.","unstructured":"[Bou05] J. Bourgain . More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory , 01 ( 01 ): 1 - 32 , 2005. [Bou05] J. Bourgain. More on the sum-product phenomenon in prime fields and its applications. International Journal of Number Theory, 01 ( 01 ): 1-32, 2005.","journal-title":"Number Theory"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-007-0593-z"},{"key":"e_1_3_2_1_13_1","first-page":"230","volume":"17","author":"Chor Benny","unstructured":"[CG88] Benny Chor and Oded Goldreich . Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing , 17 ( 2 ): 230 - 261 , 1988. [CG88] Benny Chor and Oded Goldreich. Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing, 17 ( 2 ): 230-261, 1988.","journal-title":"Computing"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54242-8_19"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.55"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897547"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.25"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897643"},{"key":"e_1_3_2_1_19_1","first-page":"331","volume-title":"Annals of Mathematics","author":"Croot Ernie","year":"2017","unstructured":"[CLP17] Ernie Croot , Vsevolod F Lev , and P\u00e9ter P\u00e1l Pach . Progression-free sets in are exponentially small . Annals of Mathematics , pages 331 - 337 , 2017 . [CLP17] Ernie Croot, Vsevolod F Lev, and P\u00e9ter P\u00e1l Pach. Progression-free sets in are exponentially small. Annals of Mathematics, pages 331-337, 2017."},{"key":"e_1_3_2_1_20_1","first-page":"1297","volume":"45","author":"Cohen Gil","unstructured":"[Coh16a] Gil Cohen . Local correlation breakers and applications to three-source extractors and mergers. SIAM Journal on Computing , 45 ( 4 ): 1297 - 1338 , 2016. [Coh16a] Gil Cohen. Local correlation breakers and applications to three-source extractors and mergers. SIAM Journal on Computing, 45 ( 4 ): 1297-1338, 2016.","journal-title":"Computing"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.28"},{"key":"e_1_3_2_1_22_1","unstructured":"[Coh17] Gil Cohen. Towards optimal two-source extractors and ramsey graphs.  [Coh17] Gil Cohen. Towards optimal two-source extractors and ramsey graphs."},{"key":"e_1_3_2_1_23_1","first-page":"1157","volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","author":"In","year":"2017","unstructured":"In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing , pages 1157 - 1170 . ACM, 2017 . In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 1157-1170. ACM, 2017."},{"key":"e_1_3_2_1_24_1","first-page":"249","volume-title":"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)","author":"Canetti Ran","unstructured":"[CPS07] Ran Canetti , Rafael Pass , and Abhi Shelat . Cryptography from sunspots: How to use an imperfect reference string . In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) , pages 249 - 259 . [CPS07] Ran Canetti, Rafael Pass, and Abhi Shelat. Cryptography from sunspots: How to use an imperfect reference string. In 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), pages 249-259."},{"key":"e_1_3_2_1_25_1","unstructured":"IEEE 2007.  IEEE 2007."},{"key":"e_1_3_2_1_26_1","first-page":"653","volume":"189","author":"Chattopadhyay Eshan","unstructured":"[CZ19] Eshan Chattopadhyay and David Zuckerman . Explicit two-source extractors and resilient functions. Annals of Mathematics , 189 ( 3 ): 653 - 705 , 2019. [CZ19] Eshan Chattopadhyay and David Zuckerman. Explicit two-source extractors and resilient functions. Annals of Mathematics, 189 ( 3 ): 653-705, 2019.","journal-title":"Mathematics"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0258-4"},{"key":"e_1_3_2_1_28_1","first-page":"2305","volume":"42","author":"Dvir Zeev","unstructured":"[DKSS13] Zeev Dvir , Swastik Kopparty , Shubhangi Saraf , and Madhu Sudan . Extensions to the method of multiplicities, with applications to kakeya sets and mergers. SIAM Journal on Computing , 42 ( 6 ): 2305 - 2328 , 2013. [DKSS13] Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, and Madhu Sudan. Extensions to the method of multiplicities, with applications to kakeya sets and mergers. SIAM Journal on Computing, 42 ( 6 ): 2305-2328, 2013.","journal-title":"Computing"},{"key":"e_1_3_2_1_29_1","unstructured":"[DOPS04] Yevgeniy Dodis Shien Jin Ong Manoj Prabhakaran and Amit Sahai.  [DOPS04] Yevgeniy Dodis Shien Jin Ong Manoj Prabhakaran and Amit Sahai."},{"key":"e_1_3_2_1_30_1","first-page":"196","volume-title":"45th Annual IEEE Symposium on Foundations of Computer Science","author":"On","year":"2004","unstructured":"On the (im) possibility of cryptography with imperfect randomness . In 45th Annual IEEE Symposium on Foundations of Computer Science , pages 196 - 205 . IEEE, 2004 . On the (im) possibility of cryptography with imperfect randomness. In 45th Annual IEEE Symposium on Foundations of Computer Science, pages 196-205. IEEE, 2004."},{"key":"e_1_3_2_1_31_1","volume-title":"Extractors for varieties. Computational complexity, 21 ( 4 ): 515-572","author":"Dvir Zeev","year":"2012","unstructured":"[Dvi12] Zeev Dvir . Extractors for varieties. Computational complexity, 21 ( 4 ): 515-572 , 2012 . [Dvi12] Zeev Dvir. Extractors for varieties. Computational complexity, 21 ( 4 ): 515-572, 2012."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1027365901231"},{"key":"e_1_3_2_1_33_1","first-page":"339","volume-title":"Annals of Mathematics","author":"Ellenberg Jordan S","year":"2017","unstructured":"[EG17] Jordan S Ellenberg and Dion Gijswijt . On large subsets of with no threeterm arithmetic progression . Annals of Mathematics , pages 339 - 343 , 2017 . [EG17] Jordan S Ellenberg and Dion Gijswijt. On large subsets of with no threeterm arithmetic progression. Annals of Mathematics, pages 339-343, 2017."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_19"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_9"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013-9152-y"},{"key":"e_1_3_2_1_37_1","first-page":"1072","volume":"36","author":"Gabizon Ariel","unstructured":"[GRS06] Ariel Gabizon , Ran Raz , and Ronen Shaltiel . Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM Journal on Computing , 36 ( 4 ): 1072 - 1094 , 2006. [GRS06] Ariel Gabizon, Ran Raz, and Ronen Shaltiel. Deterministic extractors for bit-fixing sources by obtaining an independent seed. SIAM Journal on Computing, 36 ( 4 ): 1072-1094, 2006.","journal-title":"Computing"},{"key":"e_1_3_2_1_38_1","volume-title":"Multi-source non-malleable extractors and applications. manuscript","author":"Goyal Vipul","year":"2019","unstructured":"[GSZ19] Vipul Goyal , Akshayaram Srinivasan , and Chenzhi Zhu . Multi-source non-malleable extractors and applications. manuscript , 2019 . [GSZ19] Vipul Goyal, Akshayaram Srinivasan, and Chenzhi Zhu. Multi-source non-malleable extractors and applications. manuscript, 2019."},{"key":"e_1_3_2_1_39_1","volume-title":"Unbalanced expanders and randomness extractors from parvaresh-vardy codes. Journal of the ACM (JACM), 56 ( 4 ): 20","author":"Guruswami Venkatesan","year":"2009","unstructured":"[GUV09] Venkatesan Guruswami , Christopher Umans , and Salil Vadhan . Unbalanced expanders and randomness extractors from parvaresh-vardy codes. Journal of the ACM (JACM), 56 ( 4 ): 20 , 2009 . [GUV09] Venkatesan Guruswami, Christopher Umans, and Salil Vadhan. Unbalanced expanders and randomness extractors from parvaresh-vardy codes. Journal of the ACM (JACM), 56 ( 4 ): 20, 2009."},{"key":"e_1_3_2_1_40_1","first-page":"68","volume-title":"29th Annual Symposium on Foundations of Computer Science","author":"Kahn Jef","year":"1988","unstructured":"[KKL88] Jef Kahn , Gil Kalai , and Nathan Linial . The influence of variables on boolean functions. In [Proceedings 1988 ] 29th Annual Symposium on Foundations of Computer Science , pages 68 - 80 . IEEE, 1988 . [KKL88] Jef Kahn, Gil Kalai, and Nathan Linial. The influence of variables on boolean functions. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pages 68-80. IEEE, 1988."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/11586821_22"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132613"},{"key":"e_1_3_2_1_43_1","first-page":"1231","volume":"36","author":"Kamp Jesse","unstructured":"[KZ06] Jesse Kamp and David Zuckerman . Deterministic extractors for bitifxing sources and exposure-resilient cryptography. SIAM Journal on Computing , 36 ( 5 ): 1231 - 1247 , 2006. [KZ06] Jesse Kamp and David Zuckerman. Deterministic extractors for bitifxing sources and exposure-resilient cryptography. SIAM Journal on Computing, 36 ( 5 ): 1231-1247, 2006.","journal-title":"Computing"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579319000238"},{"key":"e_1_3_2_1_45_1","first-page":"126","volume-title":"2011 IEEE 26th Annual Conference on Computational Complexity","author":"Li Xin","unstructured":"[Li11a] Xin Li . Improved constructions of three source extractors . In 2011 IEEE 26th Annual Conference on Computational Complexity , pages 126 - 136 . [Li11a] Xin Li. Improved constructions of three source extractors. In 2011 IEEE 26th Annual Conference on Computational Complexity, pages 126-136."},{"key":"e_1_3_2_1_46_1","unstructured":"IEEE 2011.  IEEE 2011."},{"key":"e_1_3_2_1_47_1","first-page":"137","volume-title":"Proceedings of the 26th Annual IEEE Conference on Computational Complexity","author":"Li Xin","year":"2011","unstructured":"[Li11b] Xin Li . A new approach to afine extractors and dispersers . In Proceedings of the 26th Annual IEEE Conference on Computational Complexity , pages 137 - 147 , 2011 . [Li11b] Xin Li. A new approach to afine extractors and dispersers. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, pages 137-147, 2011."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.19"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488708"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46494-6_21"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.58"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.58"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.26"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055486"},{"key":"e_1_3_2_1_55_1","volume-title":"34th Computational Complexity Conference, CCC 2019","author":"Li Xin","year":"2019","unstructured":"[Li19] Xin Li . Non-malleable extractors and non-malleable codes: Partially optimal constructions . In 34th Computational Complexity Conference, CCC 2019 , July 18-20, 2019 , New Brunswick, NJ, USA., pages 28 : 1-28 : 49 , 2019. [Li19] Xin Li. Non-malleable extractors and non-malleable codes: Partially optimal constructions. In 34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA., pages 28 : 1-28 : 49, 2019."},{"key":"e_1_3_2_1_56_1","unstructured":"[LPV09] Huijia Lin Rafael Pass and Muthuramakrishnan Venkitasubramaniam.  [LPV09] Huijia Lin Rafael Pass and Muthuramakrishnan Venkitasubramaniam."},{"key":"e_1_3_2_1_57_1","first-page":"179","volume-title":"Proceedings of the forty-first annual ACM symposium on Theory of computing","author":"A","year":"2009","unstructured":"A unified framework for concurrent security: universal composability from stand-alone non-malleability . In Proceedings of the forty-first annual ACM symposium on Theory of computing , pages 179 - 188 . ACM, 2009 . A unified framework for concurrent security: universal composability from stand-alone non-malleability. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pages 179-188. ACM, 2009."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780630"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039759"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052244"},{"key":"e_1_3_2_1_61_1","first-page":"168","volume":"39","author":"Rao Anup","unstructured":"[Rao09a] Anup Rao . Extractors for a constant number of polynomially small minentropy independent sources. SIAM Journal on Computing , 39 ( 1 ): 168 - 194 , 2009. [Rao09a] Anup Rao. Extractors for a constant number of polynomially small minentropy independent sources. SIAM Journal on Computing, 39 ( 1 ): 168-194, 2009.","journal-title":"Computing"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2009.36"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060593"},{"key":"e_1_3_2_1_64_1","volume-title":"Note on independent sets in steiner systems. Random Structures & Algorithms, 5 ( 1 ): 183-190","author":"R\u00f6dl Vojt\u011bch","year":"1994","unstructured":"[R\u016094] Vojt\u011bch R\u00f6dl and Edita \u0160inajov\u00e1 . Note on independent sets in steiner systems. Random Structures & Algorithms, 5 ( 1 ): 183-190 , 1994 . [R\u016094] Vojt\u011bch R\u00f6dl and Edita \u0160inajov\u00e1. Note on independent sets in steiner systems. Random Structures & Algorithms, 5 ( 1 ): 183-190, 1994."},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892063"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22186"},{"key":"e_1_3_2_1_67_1","first-page":"655","volume":"43","author":"Viola Emanuele","unstructured":"[Vio14] Emanuele Viola . Extractors for circuit sources. SIAM Journal on Computing , 43 ( 2 ): 655 - 672 , 2014. [Vio14] Emanuele Viola. Extractors for circuit sources. SIAM Journal on Computing, 43 ( 2 ): 655-672, 2014.","journal-title":"Computing"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2604-9"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384339","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:57Z","timestamp":1750199577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":67,"alternative-id":["10.1145\/3357713.3384339","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384339","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}