{"id":"https://openalex.org/W2112501493","doi":"https://doi.org/10.1145/2897518.2897644","title":"Separations in query complexity using cheat sheets","display_name":"Separations in query complexity using cheat sheets","publication_year":2016,"publication_date":"2016-06-10","ids":{"openalex":"https://openalex.org/W2112501493","doi":"https://doi.org/10.1145/2897518.2897644","mag":"2112501493"},"language":"en","primary_location":{"id":"doi:10.1145/2897518.2897644","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897644","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897644&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2897644&type=pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Scott Aaronson","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Scott Aaronson","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Shalev Ben-David","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shalev Ben-David","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":null,"display_name":"Robin Kothari","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robin Kothari","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":7.5092,"has_fulltext":true,"cited_by_count":36,"citation_normalized_percentile":{"value":0.97127781,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"863","last_page":"876"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5626000165939331},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5389000177383423},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5164999961853027},{"id":"https://openalex.org/keywords/partial-function","display_name":"Partial function","score":0.4884999990463257},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.450300008058548},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.4366999864578247},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4262000024318695},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4230000078678131},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.40689998865127563}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6169000267982483},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5626000165939331},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5389000177383423},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5164999961853027},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.4884999990463257},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4487000107765198},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.4366999864578247},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4230000078678131},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3619999885559082},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.3619999885559082},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36149999499320984},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.3156999945640564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31360000371932983},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.3100000023841858},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30489999055862427},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.29490000009536743},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.2833999991416931},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.26899999380111694},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2897518.2897644","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897644","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897644&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1511.01937","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1511.01937","pdf_url":"https://arxiv.org/pdf/1511.01937","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.4230/lipics.itcs.2017.28","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2017.28","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"doi:10.1145/2897518.2897644","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2897518.2897644","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2897644&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1943969787","display_name":null,"funder_award_id":"CCF-1412958","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5539695041","display_name":null,"funder_award_id":"W911NF-12-1-0486","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G7452299184","display_name":null,"funder_award_id":"W911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G8519316700","display_name":null,"funder_award_id":"1249349","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G882115978","display_name":"AF: Large: Theory of Computation - Pushing the State-of-the-Art","funder_award_id":"1412958","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8998121839","display_name":null,"funder_award_id":"911NF","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2112501493.pdf","grobid_xml":"https://content.openalex.org/works/W2112501493.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1618756527","https://openalex.org/W1776408431","https://openalex.org/W1859250467","https://openalex.org/W1867758558","https://openalex.org/W1927194496","https://openalex.org/W1964032471","https://openalex.org/W1969865855","https://openalex.org/W1992351599","https://openalex.org/W1995363082","https://openalex.org/W2006290558","https://openalex.org/W2009353303","https://openalex.org/W2012496360","https://openalex.org/W2014377018","https://openalex.org/W2023316152","https://openalex.org/W2034038586","https://openalex.org/W2058286540","https://openalex.org/W2067028737","https://openalex.org/W2084174412","https://openalex.org/W2084652510","https://openalex.org/W2102687371","https://openalex.org/W2107933515","https://openalex.org/W2113364475","https://openalex.org/W2117584890","https://openalex.org/W2122780600","https://openalex.org/W2123540893","https://openalex.org/W2159430156","https://openalex.org/W2175167577","https://openalex.org/W2187292610","https://openalex.org/W2220094226","https://openalex.org/W2296156273","https://openalex.org/W2887468738","https://openalex.org/W3023447009","https://openalex.org/W3023478445","https://openalex.org/W6713030424"],"related_works":[],"abstract_inverted_index":{"We":[0,35],"show":[1],"a":[2,14,38,42,67,71,93,120,130,162],"power":[3,43,59],"2.5":[4],"separation":[5,27,45],"between":[6,46,74],"bounded-error":[7],"randomized":[8],"and":[9,50,78],"quantum":[10,47,75],"query":[11,48,76],"complexity":[12,49,77],"for":[13,137],"total":[15,39,68,132],"Boolean":[16],"function,":[17],"refuting":[18],"the":[19,24,58,61,100,107],"widely":[20],"believed":[21],"conjecture":[22],"that":[23,97,123],"best":[25],"such":[26],"could":[28],"only":[29],"be":[30,159],"quadratic":[31,72],"(from":[32],"Grover's":[33],"algorithm).":[34],"also":[36,142],"present":[37],"function":[40,69,128,133],"with":[41,70,134],"4":[44],"approximate":[51],"polynomial":[52,62],"degree,":[53],"showing":[54,138],"severe":[55],"limitations":[56],"on":[57,119],"of":[60,109,152],"method.":[63],"Finally,":[64],"we":[65,98],"exhibit":[66],"gap":[73],"certificate":[79],"complexity,":[80],"which":[81,104],"is":[82,117],"optimal":[83],"(up":[84],"to":[85,158],"log":[86],"factors).":[87],"These":[88],"separations":[89],"are":[90],"shown":[91,160],"using":[92],"new,":[94],"general":[95],"technique":[96,116],"call":[99],"cheat":[101],"sheet":[102],"technique,":[103],"builds":[105],"upon":[106],"techniques":[108],"Ambainis":[110,153],"et":[111,154],"al.":[112,155],"[STOC":[113,156],"2016].":[114],"The":[115,140],"based":[118],"generic":[121],"transformation":[122],"converts":[124],"any":[125],"(possibly":[126],"partial)":[127],"into":[129],"new":[131],"desirable":[135],"properties":[136],"separations.":[139],"framework":[141],"allows":[143],"many":[144],"known":[145],"separations,":[146],"including":[147],"some":[148],"recent":[149],"breakthrough":[150],"results":[151],"2016],":[157],"in":[161],"unified":[163],"manner.":[164]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2016-06-24T00:00:00"}