{"id":"https://openalex.org/W1800460930","doi":"https://doi.org/10.1109/sfcs.1984.715908","title":"Probabilistic Communication Complexity","display_name":"Probabilistic Communication Complexity","publication_year":2005,"publication_date":"2005-08-24","ids":{"openalex":"https://openalex.org/W1800460930","doi":"https://doi.org/10.1109/sfcs.1984.715908","mag":"1800460930"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1984.715908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5111512545","display_name":"Ramamohan Paturi","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Paturi","raw_affiliation_strings":["(The Pennsylvania State University"],"affiliations":[{"raw_affiliation_string":"(The Pennsylvania State University","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070938862","display_name":"Jano\u0161 \u0160imon","orcid":"https://orcid.org/0000-0003-2870-5718"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Simon","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, Illinois 60637 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, Illinois 60637 USA","institution_ids":["https://openalex.org/I40347166"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":26,"citation_normalized_percentile":{"value":0.611441,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":89},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computational Complexity and Algorithmic Information Theory","score":0.9928,"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/T12002","display_name":"Computational Complexity and Algorithmic Information Theory","score":0.9928,"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":"Combinatorial Optimization and Complexity Theory","score":0.989,"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/T10682","display_name":"Quantum Computing and Simulation","score":0.9794,"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/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.7739788},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.72770095},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication Complexity","score":0.642304},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.62985975},{"id":"https://openalex.org/keywords/probabilistic-turing-machine","display_name":"Probabilistic Turing machine","score":0.59363824},{"id":"https://openalex.org/keywords/computability","display_name":"Computability","score":0.541343},{"id":"https://openalex.org/keywords/turing-machines","display_name":"Turing Machines","score":0.521806},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"Approximation Algorithms","score":0.516884},{"id":"https://openalex.org/keywords/fault-tolerant-quantum-computation","display_name":"Fault-tolerant Quantum Computation","score":0.51654}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.80731946},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.7739788},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.72770095},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7103089},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.63685524},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.62985975},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.61981225},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.61340505},{"id":"https://openalex.org/C144271403","wikidata":"https://www.wikidata.org/wiki/Q1191836","display_name":"Probabilistic Turing machine","level":5,"score":0.59363824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5240983},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.4942639},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49000302},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.48156026},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44371554},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42895555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3779036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37412924},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.33739412},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.19816718},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08599287},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1984.715908","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":13,"referenced_works":["https://openalex.org/W1489972621","https://openalex.org/W1991581432","https://openalex.org/W2002501531","https://openalex.org/W2006787007","https://openalex.org/W2039415399","https://openalex.org/W2054785041","https://openalex.org/W2059442002","https://openalex.org/W2082036845","https://openalex.org/W2093303125","https://openalex.org/W2123750718","https://openalex.org/W2331952463","https://openalex.org/W4212938248","https://openalex.org/W4242409733"],"related_works":["https://openalex.org/W2592218156","https://openalex.org/W2168431435","https://openalex.org/W2080505327","https://openalex.org/W2070488416","https://openalex.org/W2059442002","https://openalex.org/W2057596590","https://openalex.org/W1960332849","https://openalex.org/W1800460930","https://openalex.org/W1556737090","https://openalex.org/W1500551350"],"abstract_inverted_index":{"We":[0,101],"study":[1],"(unbounded":[2,80],"error)":[3,81],"probabilistic":[4,48,82,117],"communication":[5],"complexity.":[6],"Our":[7],"new":[8],"results":[9,92],"include":[10],"-one":[11],"way":[12],"and":[13,26],"two":[14],"complexities":[15],"differ":[16],"by":[17,77,97,115],"at":[18],"most":[19],"1":[20],"-":[21,50],"certain":[22,68],"functions":[23],"like":[24],"equality":[25],"the":[27,106,112],"verification":[28],"of":[29],"Hamming":[30],"distance":[31],"have":[32],"upper":[33],"bounds":[34],"that":[35,66,103],"are":[36],"considerably":[37],"better":[38],"than":[39],"their":[40],"counterparts":[41],"in":[42],"deterministic,":[43],"nondeterministic,":[44],"or":[45],"bounded":[46,98],"error":[47,99],"model":[49],"there":[51],"exists":[52],"a":[53,67,78],"function":[54],"which":[55],"requires":[56,70],"/spl":[57,71],"Omega/(logn)":[58],"information":[59],"transfer.":[60],"As":[61],"an":[62],"application,":[63],"we":[64],"prove":[65],"language":[69],"Omega/(nlogn)":[72],"time":[73,113],"to":[74],"be":[75],"recognized":[76],"1-tape":[79],"Turing":[83,118],"machine.":[84],"This":[85],"bound":[86,91,110],"is":[87,105],"optimal.":[88],"(Previous":[89],"lower":[90,109],"[Yao":[93],"1]":[94],"require":[95],"acceptance":[96],"computation.":[100],"believe":[102],"this":[104],"first":[107],"nontrivial":[108],"on":[111],"required":[114],"unrestricted":[116],"machines.":[119]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1800460930","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2024-10-23T14:17:26.593441","created_date":"2016-06-24"}
