{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T05:33:58Z","timestamp":1774589638561,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":365,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1249349"],"award-info":[{"award-number":["1249349"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-12-1-0486"],"award-info":[{"award-number":["W911NF-12-1-0486"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897644","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T09:04:07Z","timestamp":1465549447000},"page":"863-876","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Separations in query complexity using cheat sheets"],"prefix":"10.1145","author":[{"given":"Scott","family":"Aaronson","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Shalev","family":"Ben-David","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Robin","family":"Kothari","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704447237"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746547"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008735"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946332"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447311"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488721"},{"key":"e_1_3_2_1_7_1","volume-title":"Separations in query complexity based on pointer functions. arXiv preprint arXiv:1506.04719","author":"Ambainis A.","year":"2015","unstructured":"A. Ambainis, K. Balodis, A. Belovs, T. Lee, M. Santha, and J. Smotrovs. Separations in query complexity based on pointer functions. arXiv preprint arXiv:1506.04719, 2015."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-014-0083-2"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502097"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422474"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00144-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1313-z"},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","first-page":"280","volume-title":"Automata, Languages, and Programming","author":"Bun M.","unstructured":"M. Bun and J. Thaler. Hardness amplification and the approximate degree of constant-depth circuits. In Automata, Languages, and Programming, volume 9134 of Lecture Notes in Computer Science, pages 268\u2013280. 2015."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.27"},{"key":"e_1_3_2_1_16_1","volume-title":"Randomized communication vs. partition number. Electronic Colloquium on Computational Complexity (ECCC) TR15-169","author":"G\u00f6\u00f6s M.","year":"2015","unstructured":"M. G\u00f6\u00f6s, T. Jayram, T. Pitassi, and T. Watson. Randomized communication vs. partition number. Electronic Colloquium on Computational Complexity (ECCC) TR15-169, 2015."},{"key":"e_1_3_2_1_17_1","volume-title":"Deterministic communication vs. partition number. Electronic Colloquium on Computational Complexity (ECCC) TR15-050","author":"G\u00f6\u00f6s M.","year":"2015","unstructured":"M. G\u00f6\u00f6s, T. Pitassi, and T. Watson. Deterministic communication vs. partition number. Electronic Colloquium on Computational Complexity (ECCC) TR15-050, 2015."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250867"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1759210.1759241"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2010.31"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31594-7_47"},{"key":"e_1_3_2_1_23_1","volume-title":"On fractional block sensitivity. Electronic Colloquium on Computational Complexity (ECCC) TR13-168","author":"Kulkarni R.","year":"2013","unstructured":"R. Kulkarni and A. Tal. On fractional block sensitivity. Electronic Colloquium on Computational Complexity (ECCC) TR13-168, 2013."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148119"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.75"},{"key":"e_1_3_2_1_26_1","volume-title":"A strong direct product theorem for quantum query complexity. computational complexity, 22(2):429\u2013462","author":"Lee T.","year":"2013","unstructured":"T. Lee and J. Roland. A strong direct product theorem for quantum query complexity. computational complexity, 22(2):429\u2013462, 2013."},{"key":"e_1_3_2_1_27_1","volume-title":"Exact quantum query complexity for total Boolean functions. arXiv preprint arXiv:quant-ph\/0403168","author":"Midrijanis G.","year":"2004","unstructured":"G. Midrijanis. Exact quantum query complexity for total Boolean functions. arXiv preprint arXiv:quant-ph\/0403168, 2004."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220062"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263419"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01192527"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133080"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.44"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060108"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2013.v009a020"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298637"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a001"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422485"}],"event":{"name":"STOC '16: Symposium on Theory of Computing","location":"Cambridge MA USA","acronym":"STOC '16","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897644","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T09:41:07Z","timestamp":1763458867000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":38,"alternative-id":["10.1145\/2897518.2897644","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897644","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}