{"id":"https://openalex.org/W2082224527","doi":"https://doi.org/10.1145/2746539.2746572","title":"Exponential Separation of Information and Communication for Boolean Functions","display_name":"Exponential Separation of Information and Communication for Boolean Functions","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W2082224527","doi":"https://doi.org/10.1145/2746539.2746572","mag":"2082224527"},"language":"en","primary_location":{"id":"doi:10.1145/2746539.2746572","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021833322","display_name":"Anat Ganor","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Anat Ganor","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050781652","display_name":"Gillat Kol","orcid":"https://orcid.org/0009-0007-4725-6694"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gillat Kol","raw_affiliation_strings":["Institute for Advanced Study, Princeton, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Weizmann Institute of Science & Institute for Advanced Study, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science & Institute for Advanced Study, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.9939,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.98124674,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"557","last_page":"566"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9988999962806702,"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/T12288","display_name":"Optimization and Search Problems","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/communication-complexity","display_name":"Communication complexity","score":0.8320102691650391},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.7963119745254517},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.7085888385772705},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.6807339191436768},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5827616453170776},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5370131731033325},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5320196151733398},{"id":"https://openalex.org/keywords/double-exponential-function","display_name":"Double exponential function","score":0.49832844734191895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4957674443721771},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4901919960975647},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.487954318523407},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48525190353393555},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4610893130302429},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4564743638038635},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.43822962045669556},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4125405550003052},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.30786317586898804},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2571142315864563},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.1418294608592987}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.8320102691650391},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7963119745254517},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.7085888385772705},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.6807339191436768},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5827616453170776},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5370131731033325},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5320196151733398},{"id":"https://openalex.org/C49016629","wikidata":"https://www.wikidata.org/wiki/Q3075235","display_name":"Double exponential function","level":3,"score":0.49832844734191895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4957674443721771},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4901919960975647},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.487954318523407},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48525190353393555},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4610893130302429},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4564743638038635},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.43822962045669556},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4125405550003052},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30786317586898804},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2571142315864563},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.1418294608592987},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2746539.2746572","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W766978305","https://openalex.org/W1507711139","https://openalex.org/W1556040792","https://openalex.org/W1812653166","https://openalex.org/W1968633117","https://openalex.org/W1979790324","https://openalex.org/W1986646471","https://openalex.org/W1994916325","https://openalex.org/W1995875735","https://openalex.org/W2033261280","https://openalex.org/W2042753471","https://openalex.org/W2060108852","https://openalex.org/W2073639613","https://openalex.org/W2086467753","https://openalex.org/W2104886711","https://openalex.org/W2107917944","https://openalex.org/W2107933515","https://openalex.org/W2110110846","https://openalex.org/W2113315930","https://openalex.org/W2114607430","https://openalex.org/W2123346469","https://openalex.org/W2126420649","https://openalex.org/W2141585995","https://openalex.org/W2152912600","https://openalex.org/W2157827214","https://openalex.org/W2165440928","https://openalex.org/W2340787257","https://openalex.org/W2402091320","https://openalex.org/W2406312945","https://openalex.org/W2496614101","https://openalex.org/W2581093780","https://openalex.org/W2752870707","https://openalex.org/W2912956481","https://openalex.org/W3104935792","https://openalex.org/W3157388067","https://openalex.org/W3172945542"],"related_works":["https://openalex.org/W2120210041","https://openalex.org/W2101069215","https://openalex.org/W1977590950","https://openalex.org/W2950910290","https://openalex.org/W2082224527","https://openalex.org/W1481719945","https://openalex.org/W1909384579","https://openalex.org/W1598171766","https://openalex.org/W2057810289","https://openalex.org/W3145054722"],"abstract_inverted_index":{"We":[0],"show":[1],"an":[2,16],"exponential":[3],"gap":[4,60,77],"between":[5,78],"communication":[6,30,38,79,83,94],"complexity":[7,10,25,31,80,95],"and":[8,28,70,81],"information":[9,24],"for":[11,40,92,117],"boolean":[12,43,97,148],"functions,":[13],"by":[14],"giving":[15],"explicit":[17],"example":[18,74],"of":[19,56,68,96,147],"a":[20,37,41,54,66,76,87,102,114,138],"partial":[21,42],"function":[22,44],"with":[23,119],"\u2264":[26],"O(k),":[27],"distributional":[29,93],"\u2265":[32],"2k.":[33],"This":[34],"shows":[35,75],"that":[36,86,112],"protocol":[39],"cannot":[45,99],"always":[46],"be":[47],"compressed":[48],"to":[49,130],"its":[50],"internal":[51],"information.":[52],"By":[53,65],"result":[55,67,91,116],"Braverman":[57,69],"[Bra12],":[58],"our":[59,73],"is":[61],"the":[62,131,134,143],"largest":[63],"possible.":[64],"Rao":[71],"[BR11],":[72],"amortized":[82],"complexity,":[84],"implying":[85],"tight":[88],"direct":[89],"sum":[90],"functions":[98],"hold,":[100],"answering":[101],"long":[103,121,125],"standing":[104],"open":[105],"problem.":[106],"Our":[107],"techniques":[108],"build":[109],"on":[110],"[GKR14],":[111],"proved":[113],"similar":[115],"relations":[118],"very":[120],"outputs":[122],"(double":[123],"exponentially":[124],"in":[126],"k).":[127],"In":[128],"addition":[129],"stronger":[132],"result,":[133],"current":[135],"work":[136],"gives":[137],"simpler":[139],"proof,":[140],"benefiting":[141],"from":[142],"short":[144],"output":[145],"length":[146],"functions.":[149]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":6}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}