{"id":"https://openalex.org/W4399521384","doi":"https://doi.org/10.1145/3618260.3649716","title":"No Complete Problem for Constant-Cost Randomized Communication","display_name":"No Complete Problem for Constant-Cost Randomized Communication","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399521384","doi":"https://doi.org/10.1145/3618260.3649716"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649716","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649716","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649716","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649716","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016790592","display_name":"Yuting Fang","orcid":"https://orcid.org/0000-0003-4741-5329"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yuting Fang","raw_affiliation_strings":["Ohio State University, Columbus, USA"],"raw_orcid":"https://orcid.org/0000-0003-4741-5329","affiliations":[{"raw_affiliation_string":"Ohio State University, Columbus, USA","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036939328","display_name":"Lianna Hambardzumyan","orcid":"https://orcid.org/0009-0003-3217-5462"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Lianna Hambardzumyan","raw_affiliation_strings":["Hebrew University of Jerusalem, Jerusalem, Israel"],"raw_orcid":"https://orcid.org/0009-0003-3217-5462","affiliations":[{"raw_affiliation_string":"Hebrew University of Jerusalem, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078658717","display_name":"Nathaniel Harms","orcid":"https://orcid.org/0000-0003-0259-9355"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Nathaniel Harms","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0000-0003-0259-9355","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007198874","display_name":"Pooya Hatami","orcid":"https://orcid.org/0000-0001-7928-8008"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pooya Hatami","raw_affiliation_strings":["Ohio State University, Columbus, USA"],"raw_orcid":"https://orcid.org/0000-0001-7928-8008","affiliations":[{"raw_affiliation_string":"Ohio State University, Columbus, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5016790592"],"corresponding_institution_ids":["https://openalex.org/I52357470"],"apc_list":null,"apc_paid":null,"fwci":1.3828,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.82448346,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1287","last_page":"1298"},"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.9998999834060669,"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.9998999834060669,"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.9991999864578247,"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.9986000061035156,"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/constant","display_name":"Constant (computer programming)","score":0.7917972803115845},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7263962030410767},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6667149066925049},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5365490913391113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5331823825836182},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5053406357765198},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.4575267732143402},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4379596710205078},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3616291284561157},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2346663773059845},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.0664389431476593}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7917972803115845},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7263962030410767},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6667149066925049},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5365490913391113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5331823825836182},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5053406357765198},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.4575267732143402},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4379596710205078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3616291284561157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2346663773059845},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0664389431476593},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649716","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649716","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649716","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649716","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649716","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649716","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4399521384.pdf"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1486417233","https://openalex.org/W1964507566","https://openalex.org/W1970169765","https://openalex.org/W2010796327","https://openalex.org/W2016443407","https://openalex.org/W2113315930","https://openalex.org/W2120210041","https://openalex.org/W2336710587","https://openalex.org/W2793039178","https://openalex.org/W2888426597","https://openalex.org/W2912462513","https://openalex.org/W2962932693","https://openalex.org/W2963384289","https://openalex.org/W2988646420","https://openalex.org/W3023250268","https://openalex.org/W3137429815","https://openalex.org/W3164123192","https://openalex.org/W3182730461","https://openalex.org/W3216299385","https://openalex.org/W3217052763","https://openalex.org/W4211154544","https://openalex.org/W4226303352","https://openalex.org/W4226427252","https://openalex.org/W4281666742","https://openalex.org/W4376639480","https://openalex.org/W4381434840","https://openalex.org/W4390575964","https://openalex.org/W4390575983","https://openalex.org/W4393185920","https://openalex.org/W6910326747","https://openalex.org/W6948000019"],"related_works":["https://openalex.org/W2943247777","https://openalex.org/W2740543340","https://openalex.org/W2371167013","https://openalex.org/W1582340598","https://openalex.org/W1541021634","https://openalex.org/W2794545997","https://openalex.org/W2584980534","https://openalex.org/W2182731056","https://openalex.org/W66917582","https://openalex.org/W1600949677"],"abstract_inverted_index":{"We":[0,56,82],"prove":[1,92],"that":[2,34,59,75,90,105],"the":[3,60],"class":[4],"of":[5,116,120],"communication":[6],"problems":[7,37,63],"with":[8,49],"public-coin":[9],"randomized":[10,27],"constant-cost":[11,28,46],"protocols,":[12],"called":[13],"BPP0,":[14,32,99],"does":[15],"not":[16,78],"contain":[17],"a":[18,45,84,113],"complete":[19,79],"problem.":[20],"In":[21],"other":[22,36],"words,":[23],"there":[24],"is":[25,77],"no":[26],"problem":[29],"Q":[30],"\u2208":[31,39],"such":[33],"all":[35],"P":[38],"BPP0":[40],"can":[41,91],"be":[42,110],"computed":[43],"by":[44],"deterministic":[47],"protocol":[48],"access":[50],"to":[51],"an":[52,65],"oracle":[53],"for":[54,80],"Q.":[55],"also":[57],"show":[58,104],"k-Hamming":[61,106],"Distance":[62,107],"form":[64],"infinite":[66],"hierarchy":[67],"within":[68],"BPP0.":[69,81],"Previously,":[70],"it":[71],"was":[72],"known":[73],"only":[74],"Equality":[76],"introduce":[83],"new":[85],"technique,":[86],"using":[87],"Ramsey":[88],"theory,":[89],"lower":[93],"bounds":[94],"against":[95],"arbitrary":[96],"oracles":[97],"in":[98],"and":[100],"more":[101],"generally,":[102],"we":[103],"matrices":[108,121],"cannot":[109],"expressed":[111],"as":[112],"Boolean":[114],"combination":[115],"any":[117],"constant":[118],"number":[119],"which":[122],"forbid":[123],"large":[124],"Greater-Than":[125],"subproblems.":[126]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}