{"id":"https://openalex.org/W2133873808","doi":"https://doi.org/10.1109/focs.2008.20","title":"The Unbounded-Error Communication Complexity of Symmetric Functions","display_name":"The Unbounded-Error Communication Complexity of Symmetric Functions","publication_year":2008,"publication_date":"2008-10-01","ids":{"openalex":"https://openalex.org/W2133873808","doi":"https://doi.org/10.1109/focs.2008.20","mag":"2133873808"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2008.20","pdf_url":null,"source":null,"license":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/A5079755716","display_name":"Alexander A. Sherstov","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I16452829","https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A.A. Sherstov","raw_affiliation_string":"Department of Computer Sciences, University of Texas, Austin, USA","raw_affiliation_strings":["Department of Computer Sciences, University of Texas, Austin, USA"]}],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079755716"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":16,"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/T10720","display_name":"Combinatorial Optimization and Complexity Theory","score":0.9998,"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":"Combinatorial Optimization and Complexity Theory","score":0.9998,"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/T12072","display_name":"Active Learning in Machine Learning Research","score":0.9993,"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/T10237","display_name":"Advanced Cryptographic Schemes and Protocols","score":0.9992,"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":[{"keyword":"complexity","score":0.4698},{"keyword":"communication","score":0.3568},{"keyword":"functions","score":0.3288},{"keyword":"unbounded-error","score":0.25}],"concepts":[{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6161176},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5627766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47350484},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46818745},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.45462468},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45415866},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36805606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3646251},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33770588},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.17055413},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10867804},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0685544},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2008.20","pdf_url":null,"source":null,"license":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"referenced_works_count":16,"referenced_works":["https://openalex.org/W1517311456","https://openalex.org/W1980223785","https://openalex.org/W2008671796","https://openalex.org/W2032758195","https://openalex.org/W2053590396","https://openalex.org/W2070486524","https://openalex.org/W2074760215","https://openalex.org/W2080861403","https://openalex.org/W2093469244","https://openalex.org/W2102570263","https://openalex.org/W2107917944","https://openalex.org/W2120210041","https://openalex.org/W2123750718","https://openalex.org/W2143355494","https://openalex.org/W2148211896","https://openalex.org/W4229606576"],"related_works":["https://openalex.org/W1513451900","https://openalex.org/W2130100567","https://openalex.org/W2328371232","https://openalex.org/W1481287275","https://openalex.org/W2620744223","https://openalex.org/W2610939548","https://openalex.org/W2057810289","https://openalex.org/W4288641573","https://openalex.org/W2907393545","https://openalex.org/W2962784854"],"ngrams_url":"https://api.openalex.org/works/W2133873808/ngrams","abstract_inverted_index":{"We":[0],"prove":[1,188],"an":[2],"essentially":[3],"tight":[4],"lower":[5,85,97,159,169],"bound":[6],"on":[7,141,203],"the":[8,38,57,70,74,107,155,204],"unbounded-error":[9,67],"communication":[10,39,78,158],"complexity":[11,40],"of":[12,41,59,62,73,77,111,177],"every":[13],"symmetric":[14],"function,":[15],"i.e.,f(x,y)=D(|x":[16],"Lambda":[17],"y|),":[18],"where":[19,54],"D:{0,1,...,n}-rarr{0,1}":[20],"is":[21,43,56,69,89,119],"a":[22,90,129,136,190,200],"given":[23,130],"predicate":[24,131,192],"and":[25,50,81,83,114,182],"x,y":[26],"range":[27],"over":[28],"{0,1}":[29],"n":[32,148],".":[33],"Specifically,":[34],"we":[35,126,165],"show":[36,127],"that":[37,128,189],"f":[42],"between":[44],"Theta(k/log":[45],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">5":[48],"n)":[49],"Theta(k":[51],"log":[52],"n),":[53],"k":[55],"number":[58],"value":[60],"changes":[61],"D":[63,132],"in":[64,87,102,106,180,184],"{0,1,...,n}.":[65],"The":[66,93],"model":[68,104],"most":[71],"powerful":[72],"basic":[75],"models":[76],"(both":[79],"classical":[80],"quantum),":[82],"proving":[84],"bounds":[86,98,160,170],"it":[88],"considerable":[91],"challenge.":[92],"only":[94],"previous":[95],"nontrivial":[96],"for":[99,161],"explicit":[100],"functions":[101],"this":[103],"appear":[105],"ground":[108],"breaking":[109],"work":[110],"Forster":[112],"(2001)":[113],"its":[115],"extensions.":[116],"Our":[117],"proof":[118],"built":[120],"around":[121],"two":[122],"novel":[123],"ideas.":[124],"First,":[125],"gives":[133],"rise":[134],"to":[135,153,157,175,187,195,199],"rapidly":[137],"mixing":[138],"random":[139],"walk":[140],"Z":[142],"2":[145],",":[149],"which":[150],"allows":[151],"us":[152],"reduce":[154],"problem":[156],"typical":[162,191],"predicates.":[163],"Second,":[164],"use":[166],"Paturi's":[167],"approximation":[168],"(1992),":[171],"suitably":[172],"generalized":[173],"here":[174],"clusters":[176],"real":[178],"nodes":[179],"[0,n]":[181],"interpreted":[183],"their":[185],"dualform,":[186],"behaves":[193],"analogous":[194],"PARITY":[196],"with":[197],"respect":[198],"smooth":[201],"distribution":[202],"inputs.":[205]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2133873808","counts_by_year":[],"updated_date":"2024-03-26T05:50:36.856893","created_date":"2016-06-24"}