{"id":"https://openalex.org/W2399132114","doi":"https://doi.org/10.1007/s00037-018-0166-6","title":"The Landscape of Communication Complexity Classes","display_name":"The Landscape of Communication Complexity Classes","publication_year":2018,"publication_date":"2018-03-22","ids":{"openalex":"https://openalex.org/W2399132114","doi":"https://doi.org/10.1007/s00037-018-0166-6","mag":"2399132114"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-018-0166-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-018-0166-6","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.86","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065903790","display_name":"Mika G\u00f6\u00f6s","orcid":null},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mika G\u00f6\u00f6s","raw_affiliation_strings":["Harvard University, Cambridge, USA","Harvard University ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, USA","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Harvard University ,","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003318200","display_name":"Toniann Pitassi","orcid":"https://orcid.org/0000-0002-8668-2174"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Toniann Pitassi","raw_affiliation_strings":["University of Toronto, Toronto, Canada","University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004743191","display_name":"Thomas Watson","orcid":null},"institutions":[{"id":"https://openalex.org/I94658018","display_name":"University of Memphis","ror":"https://ror.org/01cq23130","country_code":"US","type":"education","lineage":["https://openalex.org/I94658018"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Thomas Watson","raw_affiliation_strings":["University of Memphis, Memphis, USA","Univ. of Memphis"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Memphis, Memphis, USA","institution_ids":["https://openalex.org/I94658018"]},{"raw_affiliation_string":"Univ. of Memphis","institution_ids":["https://openalex.org/I94658018"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004743191"],"corresponding_institution_ids":["https://openalex.org/I94658018"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.1899,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.49437047,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":"2","first_page":"245","last_page":"304"},"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.9994999766349792,"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.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","score":0.9970999956130981,"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.9933000206947327,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.474510133266449},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.46983760595321655},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41277286410331726}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.474510133266449},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.46983760595321655},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41277286410331726}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00037-018-0166-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-018-0166-6","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:6199","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.86","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:infoscience.epfl.ch:299580","is_oa":true,"landing_page_url":"https://infoscience.epfl.ch/handle/20.500.14299/194042","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"research article"},{"id":"doi:10.4230/lipics.icalp.2016.86","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2016.86","pdf_url":null,"source":null,"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":"ConferencePaper"},{"id":"mag:2399132114","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":null},{"id":"mag:2530904468","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2016/6199/pdf/LIPIcs-ICALP-2016-86.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418971","display_name":"International Colloquium on Automata, Languages and Programming","issn_l":null,"issn":null,"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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Colloquium on Automata, Languages and Programming","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:6199","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.86","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":68,"referenced_works":["https://openalex.org/W63563543","https://openalex.org/W151690135","https://openalex.org/W766978305","https://openalex.org/W1530008367","https://openalex.org/W1755536430","https://openalex.org/W1965748471","https://openalex.org/W1977921381","https://openalex.org/W1984477611","https://openalex.org/W1984976620","https://openalex.org/W1990029940","https://openalex.org/W1996146326","https://openalex.org/W1998918799","https://openalex.org/W2006699094","https://openalex.org/W2007849544","https://openalex.org/W2008671796","https://openalex.org/W2018142322","https://openalex.org/W2018302254","https://openalex.org/W2020029222","https://openalex.org/W2039487342","https://openalex.org/W2042753471","https://openalex.org/W2043280328","https://openalex.org/W2048910070","https://openalex.org/W2050981589","https://openalex.org/W2052309234","https://openalex.org/W2063158069","https://openalex.org/W2070053775","https://openalex.org/W2070486524","https://openalex.org/W2075106440","https://openalex.org/W2077740213","https://openalex.org/W2079192595","https://openalex.org/W2082224527","https://openalex.org/W2084471831","https://openalex.org/W2088263428","https://openalex.org/W2093454413","https://openalex.org/W2097786318","https://openalex.org/W2107917944","https://openalex.org/W2114305058","https://openalex.org/W2114522915","https://openalex.org/W2114626874","https://openalex.org/W2117822564","https://openalex.org/W2120210041","https://openalex.org/W2125389627","https://openalex.org/W2128633442","https://openalex.org/W2137407595","https://openalex.org/W2137442467","https://openalex.org/W2143355494","https://openalex.org/W2146688002","https://openalex.org/W2146950091","https://openalex.org/W2148042319","https://openalex.org/W2158764863","https://openalex.org/W2163605617","https://openalex.org/W2174130830","https://openalex.org/W2176316436","https://openalex.org/W2249023948","https://openalex.org/W2281178725","https://openalex.org/W2331432079","https://openalex.org/W2536688806","https://openalex.org/W2571478795","https://openalex.org/W2578005905","https://openalex.org/W2612676793","https://openalex.org/W2912052665","https://openalex.org/W2963248611","https://openalex.org/W2963914453","https://openalex.org/W4210551624","https://openalex.org/W4214506076","https://openalex.org/W4239261415","https://openalex.org/W4242998647","https://openalex.org/W4383163589"],"related_works":["https://openalex.org/W2793039178","https://openalex.org/W3046803118","https://openalex.org/W2970049274","https://openalex.org/W3008650101","https://openalex.org/W3167488367","https://openalex.org/W2950680601","https://openalex.org/W42931805","https://openalex.org/W1624183486","https://openalex.org/W3170426943","https://openalex.org/W2096390054","https://openalex.org/W3037028364","https://openalex.org/W1793599134","https://openalex.org/W2951447434","https://openalex.org/W3204206815","https://openalex.org/W2394532980","https://openalex.org/W2945959217","https://openalex.org/W2626569379","https://openalex.org/W2183038759","https://openalex.org/W2913548468","https://openalex.org/W2254028205"],"abstract_inverted_index":{"We":[0,119,146,183],"prove":[1,114,121,148,184],"several":[2],"results":[3,60],"which,":[4],"together":[5],"with":[6,81],"prior":[7],"work,":[8],"provide":[9],"a":[10,185],"nearly-complete":[11],"picture":[12],"of":[13,27,53,139,159,161],"the":[14,51,86,90,96,130,137,157],"relationships":[15],"among":[16],"classical":[17],"communication":[18,55,181],"complexity":[19],"classes":[20,32],"between":[21],"$${\\mathsf{P}}$$":[22],"and":[23,196],"$${\\mathsf{PSPACE}}$$":[24],",":[25,67,106,126,153],"short":[26],"proving":[28],"lower":[29,37,117],"bounds":[30,38],"against":[31],"for":[33,107],"which":[34,108],"no":[35],"explicit":[36,116],"were":[39],"already":[40],"known.":[41],"Our":[42],"article":[43],"also":[44,120,147],"serves":[45],"as":[46],"an":[47,168],"up-to-date":[48],"survey":[49],"on":[50,193],"state":[52],"structural":[54],"complexity.":[56],"Among":[57],"our":[58],"new":[59,186],"we":[61,166],"show":[62],"that":[63,68,92,122,149,190],"$${\\mathsf{MA}":[64],"\\not\\subseteq":[65,124,151],"\\mathsf{ZPP}^{\\mathsf{NP}[1]}}$$":[66,125],"is,":[69],"Merlin\u2013Arthur":[70],"proof":[71],"systems":[72],"cannot":[73],"be":[74],"simulated":[75],"by":[76],"zero-sided":[77],"error":[78],"randomized":[79],"protocols":[80],"one":[82],"$${\\mathsf{NP}}$$":[83,163],"query.":[84],"Here":[85],"class":[87,131,158],"$$\\mathsf{ZPP}^{\\mathsf{NP}[1]}$$":[88],"has":[89],"property":[91],"generalizing":[93],"it":[94,101,109],"in":[95,180],"slightest":[97],"ways":[98],"would":[99],"make":[100],"contain":[102],"$${\\mathsf{AM}":[103],"\\cap":[104],"\\mathsf{coAM}}$$":[105],"is":[110,129,136,156],"notoriously":[111],"open":[112,170],"to":[113],"any":[115],"bounds.":[118],"$${\\mathsf{US}":[123,150],"where":[127,141,154],"$${\\mathsf{US}}$$":[128],"whose":[132],"canonically":[133],"complete":[134],"problem":[135],"variant":[138],"set-disjointness":[140],"yes-instances":[142],"are":[143],"uniquely":[144],"intersecting.":[145],"\\mathsf{coDP}}$$":[152],"$${\\mathsf{DP}}$$":[155],"differences":[160],"two":[162],"sets.":[164],"Finally,":[165],"explore":[167],"intriguing":[169],"issue:":[171],"Are":[172],"rank-1":[173],"matrices":[174],"inherently":[175],"more":[176],"powerful":[177],"than":[178],"rectangles":[179],"complexity?":[182],"separation":[187],"concerning":[188],"$${\\mathsf{PP}}$$":[189],"sheds":[191],"light":[192],"this":[194],"issue":[195],"strengthens":[197],"some":[198],"previously":[199],"known":[200],"separations.":[201]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}