{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T22:47:09Z","timestamp":1779230829808,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451047","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1330-1342","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Degree vs. approximate degree and Quantum implications of Huang\u2019s sensitivity theorem"],"prefix":"10.1145","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[{"name":"University of Texas at Austin, USA"}]},{"given":"Shalev","family":"Ben-David","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}]},{"given":"Robin","family":"Kothari","sequence":"additional","affiliation":[{"name":"Microsoft Quantum, USA \/ Microsoft Research, USA"}]},{"given":"Shravas","family":"Rao","sequence":"additional","affiliation":[{"name":"Northwestern University, USA"}]},{"given":"Avishay","family":"Tal","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897644"},{"key":"e_1_3_2_1_2_1","volume-title":"Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem. arXiv preprint arXiv:2010.12629","author":"Aaronson Scott","year":"2020","unstructured":"Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, and Avishay Tal. 2020. Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem. arXiv preprint arXiv:2010.12629, 2020."},{"key":"e_1_3_2_1_3_1","volume-title":"Quantum Implications of Huang's Sensitivity Theorem. arXiv preprint arXiv:2004.13231","author":"Aaronson Scott","year":"2020","unstructured":"Scott Aaronson, Shalev Ben-David, Robin Kothari, and Avishay Tal. 2020. Quantum Implications of Huang's Sensitivity Theorem. arXiv preprint arXiv:2004.13231, 2020."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1826"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488721"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3106234"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081088708817810"},{"key":"e_1_3_2_1_8_1","volume-title":"k-Forrelation Optimally Separates Quantum and Classical Query Complexity. arXiv preprint arXiv:2008.07003","author":"Bansal Nikhil","year":"2020","unstructured":"Nikhil Bansal and Makrand Sinha. 2020. k-Forrelation Optimally Separates Quantum and Classical Query Complexity. arXiv preprint arXiv:2008.07003, 2020."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.02.002"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2003.1214419"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00040"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2017.28"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814607"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1313-z"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_26"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47672-7_22"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.10"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Amit Chakrabarti and Subhash Khot. 2001. Improved Lower Bounds on the Randomized Complexity of Graph Properties. In Automata Languages and Programming. Pages 285\u2013296. isbn:978-3-540-48224-6 https:\/\/doi.org\/10.1007\/3-540-48224-5_24 10.1007\/3-540-48224-5_24","DOI":"10.1007\/3-540-48224-5_24"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","unstructured":"Yevgeniy Dodis and Sanjeev Khanna. 1999. Space-Time Tradeoffs for Graph Properties. In Automata Languages and Programming. Pages 291\u2013300. https:\/\/doi.org\/10.1007\/3-540-48523-6_26 10.1007\/3-540-48523-6_26","DOI":"10.1007\/3-540-48523-6_26"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","unstructured":"Ehud Friedgut Jeff Kahn and Avi Wigderson. 2002. Computing Graph Properties by Randomized Subcube Partitions. In Randomization and Approximation Techniques in Computer Science. Pages 105\u2013113. https:\/\/doi.org\/10.1007\/3-540-45726-7_9 10.1007\/3-540-45726-7_9","DOI":"10.1007\/3-540-45726-7_9"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.27"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3170711"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1059369"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/bf01206357"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2019.190.3.6"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/bf02579140"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62258"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90330-V"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2016.48"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.4086\/cjtcs.2016.008"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0212-7"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2008.25"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-2160-5"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/050643684"},{"key":"e_1_3_2_1_40_1","volume-title":"Exact quantum query complexity for total Boolean functions. arXiv preprint quant-ph\/0403168","author":"Midrijanis Gatis","year":"2004","unstructured":"Gatis Midrijanis. 2004. Exact quantum query complexity for total Boolean functions. arXiv preprint quant-ph\/0403168, 2004."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220062"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263419"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01192527"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139814782"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.34"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.44"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90053-0"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200762"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.44"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/120888703"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a020"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a018"},{"key":"e_1_3_2_1_53_1","volume-title":"An Optimal Separation of Randomized and Quantum Query Complexity. arXiv preprint arXiv:2008.10223","author":"Sherstov Alexander A","year":"2020","unstructured":"Alexander A Sherstov, Andrey A Storozhenko, and Pei Wu. 2020. An Optimal Separation of Randomized and Quantum Query Complexity. arXiv preprint arXiv:2008.10223, 2020."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a001"},{"key":"e_1_3_2_1_55_1","volume-title":"Structure and randomness","author":"Tao Terence","year":"2007","unstructured":"Terence Tao. 2008. Structure and randomness : pages from year one of a mathematical blog. American Mathematical Society. isbn:978-0-8218-4695-7 https:\/\/terrytao.wordpress.com\/2007\/09\/05\/amplification-arbitrage-and-the-tensor-power-trick\/"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(86)90300-9"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217031"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90003-N"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451047","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451047","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":59,"alternative-id":["10.1145\/3406325.3451047","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451047","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}