{"id":"https://openalex.org/W2571088576","doi":"https://doi.org/10.1137/130928273","title":"Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications","display_name":"Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2571088576","doi":"https://doi.org/10.1137/130928273","mag":"2571088576"},"language":"en","primary_location":{"id":"doi:10.1137/130928273","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130928273","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","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/A5024725897","display_name":"Iordanis Kerenidis","orcid":"https://orcid.org/0000-0003-0659-3727"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Iordanis Kerenidis","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046789004","display_name":"Sophie Laplante","orcid":"https://orcid.org/0009-0005-2304-4625"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sophie Laplante","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020069204","display_name":"Virginie Lerays","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Virginie Lerays","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040968296","display_name":"J\u00e9r\u00e9mie Roland","orcid":"https://orcid.org/0000-0003-0556-0376"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J\u00e9r\u00e9mie Roland","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5103581925","display_name":"David Xiao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Xiao","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5024725897"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7459,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.95395138,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"44","issue":"5","first_page":"1550","last_page":"1572"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9966999888420105,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7685211896896362},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7655789852142334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6010119318962097},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5516065359115601},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5484252572059631},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5098423361778259},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5026636123657227},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.4563712179660797},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.420365571975708},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.39232295751571655},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36020636558532715},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.347899854183197},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31079018115997314}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7685211896896362},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7655789852142334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6010119318962097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5516065359115601},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5484252572059631},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5098423361778259},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5026636123657227},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.4563712179660797},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.420365571975708},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.39232295751571655},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36020636558532715},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.347899854183197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31079018115997314},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/130928273","is_oa":false,"landing_page_url":"https://doi.org/10.1137/130928273","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/220050","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/220050","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on computing, 44 (5","raw_type":"info:ulb-repo/semantics/openurl/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8500000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1589803317","https://openalex.org/W1984227438","https://openalex.org/W1985526537","https://openalex.org/W2002917701","https://openalex.org/W2066056831","https://openalex.org/W2073639613","https://openalex.org/W2093243820","https://openalex.org/W2096056914","https://openalex.org/W2107917944","https://openalex.org/W2121018692","https://openalex.org/W2122058331","https://openalex.org/W2174589003","https://openalex.org/W4248270945","https://openalex.org/W4256261794","https://openalex.org/W4297970684"],"related_works":["https://openalex.org/W2173966285","https://openalex.org/W2120210041","https://openalex.org/W2132910148","https://openalex.org/W2082636129","https://openalex.org/W2610939548","https://openalex.org/W2027620237","https://openalex.org/W270168689","https://openalex.org/W3126743327","https://openalex.org/W2171756291","https://openalex.org/W2415632638"],"abstract_inverted_index":{"We":[0,113,195],"show":[1,183,226],"that":[2,51,162,170,227,262],"almost":[3],"all":[4,66],"known":[5],"lower":[6,14,53,281],"bound":[7,30,64,282],"methods":[8,68,75],"for":[9,16,148],"communication":[10,270],"complexity":[11,57,154,230,271,286],"are":[12],"also":[13],"bounds":[15,54],"the":[17,28,37,55,70,77,80,85,89,104,141,191,204,212,228,232,244,284,288],"information":[18,56,153,229,274,285],"complexity.":[19,275],"In":[20],"particular,":[21],"we":[22,182,225,277],"define":[23],"a":[24,95,109,116,146,149,159,186],"relaxed":[25,62,192],"version":[26],"of":[27,31,36,58,203,211,219,231,243,251,287],"partition":[29,63,90,193],"Jain":[32],"and":[33,49,73,84,100,122,127,169,239,272],"Klauck":[34],"[Proceedings":[35,210],"2010":[38],"IEEE":[39],"25th":[40],"Annual":[41,214,246],"Conference":[42],"on":[43,178,217,249,283],"Computational":[44],"Complexity,":[45],"2010,":[46],"pp.":[47,139,222,254],"247--258]":[48],"prove":[50],"it":[52],"any":[59],"function.":[60],"Our":[61,92],"subsumes":[65],"norm-based":[67],"(e.g.,":[69,76],"$\\gamma_2$":[71],"method)":[72],"rectangle-based":[74],"rectangle/corruption":[78],"bound,":[79,83],"smooth":[81],"rectangle":[82],"discrepancy":[86],"bound),":[87],"except":[88],"bound.":[91,194],"result":[93],"uses":[94],"new":[96],"connection":[97],"between":[98,268],"rectangles":[99],"zero-communication":[101,160,187],"protocols,":[102],"where":[103],"players":[105],"can":[106,157],"either":[107],"output":[108],"value":[110],"or":[111],"abort.":[112],"prove,":[114],"using":[115],"sampling":[117],"protocol":[118,147,161,188],"designed":[119],"by":[120,208],"Braverman":[121,209],"Weinstein":[123],"[in":[124],"Approximation,":[125],"Randomization,":[126],"Combinatorial":[128],"Optimization,":[129],"Lecture":[130],"Notes":[131],"in":[132,234,259],"Comput.":[133],"Sci.":[134],"7408,":[135],"Springer,":[136],"Heidelberg,":[137],"2012,":[138,221],"459--470],":[140],"following":[142],"compression":[143],"lemma:":[144],"given":[145],"function":[150],"$f$":[151,172],"with":[152,174],"$I$,":[155],"one":[156],"construct":[158],"has":[163],"nonabort":[164],"probability":[165,176],"at":[166],"least":[167],"$2^{-O(I)}$":[168],"computes":[171],"correctly":[173],"high":[175],"conditioned":[177],"not":[179],"aborting.":[180],"Then,":[181],"how":[184],"such":[185],"relates":[189],"to":[190,200],"use":[196],"our":[197],"main":[198],"theorem":[199],"resolve":[201],"three":[202],"open":[205],"questions":[206],"raised":[207],"44th":[213],"ACM":[215,247],"Symposium":[216,248],"Theory":[218,250],"Computing,":[220,252],"505--524].":[223],"First,":[224],"Vector":[233],"Subspace":[235],"Problem":[236],"[B.":[237],"Klartag":[238],"O.":[240],"Regev,":[241],"Proceedings":[242],"43rd":[245],"2011,":[253],"31--40]":[255],"is":[256],"$\\Omega(n^{1/3})$,":[257],"which,":[258],"turn,":[260],"implies":[261],"there":[263],"exists":[264],"an":[265,279],"exponential":[266],"separation":[267],"quantum":[269],"classical":[273],"Moreover,":[276],"provide":[278],"$\\Omega(n)$":[280],"Gap":[289],"Hamming":[290],"Distance":[291],"Problem.":[292]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}