{"id":"https://openalex.org/W1480704164","doi":"https://doi.org/10.1007/s00493-011-2580-0","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/W1480704164","doi":"https://doi.org/10.1007/s00493-011-2580-0","mag":"1480704164"},"language":"en","primary_location":{"id":"doi:10.1007/s00493-011-2580-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-011-2580-0","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","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/A5079755716","display_name":"Alexander A. Sherstov","orcid":"https://orcid.org/0000-0002-2488-7852"},"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/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alexander A. Sherstov","raw_affiliation_strings":["Department of Computer Sciences, University of Texas, Austin, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, University of Texas, Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"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,"fwci":2.8602,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.90785066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"31","issue":"5","first_page":"384","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","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/T12072","display_name":"Machine Learning and Algorithms","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.9983000159263611,"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 Algorithms and Architecture","score":0.9977999925613403,"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.5165785551071167},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.48457181453704834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4142526090145111},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4001103341579437},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3298475742340088}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5165785551071167},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.48457181453704834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4142526090145111},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4001103341579437},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3298475742340088}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1007/s00493-011-2580-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00493-011-2580-0","pdf_url":null,"source":{"id":"https://openalex.org/S72366220","display_name":"COMBINATORICA","issn_l":"0209-9683","issn":["0209-9683","1439-6912"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorica","raw_type":"journal-article"},{"id":"doi:10.1109/focs.2008.20","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2008.20","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 49th Annual IEEE Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.140.2411","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.2411","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/~sherstov/publications/pdf/unbounded-symm.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.305.242","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.305.242","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/%7Esherstov/publications/pdf/unbounded-symm.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.634.4354","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.634.4354","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2007/112/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.3180","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.3180","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.utexas.edu/ftp/pub/techreports/tr07-53.pdf","raw_type":"text"},{"id":"mag:1480704164","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc14.html#Sherstov07b","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":53,"referenced_works":["https://openalex.org/W193605690","https://openalex.org/W215161086","https://openalex.org/W1500625764","https://openalex.org/W1515707347","https://openalex.org/W1517311456","https://openalex.org/W1531592115","https://openalex.org/W1553489951","https://openalex.org/W1671393514","https://openalex.org/W1969865855","https://openalex.org/W1973728061","https://openalex.org/W1976697079","https://openalex.org/W1980223785","https://openalex.org/W1996146326","https://openalex.org/W2007407491","https://openalex.org/W2008671796","https://openalex.org/W2019363670","https://openalex.org/W2025070700","https://openalex.org/W2026103826","https://openalex.org/W2029734507","https://openalex.org/W2032758195","https://openalex.org/W2034038586","https://openalex.org/W2050739958","https://openalex.org/W2053590396","https://openalex.org/W2070486524","https://openalex.org/W2074760215","https://openalex.org/W2077740213","https://openalex.org/W2079866219","https://openalex.org/W2080210666","https://openalex.org/W2080861403","https://openalex.org/W2088263428","https://openalex.org/W2093469244","https://openalex.org/W2097886040","https://openalex.org/W2102570263","https://openalex.org/W2107917944","https://openalex.org/W2114522915","https://openalex.org/W2119877753","https://openalex.org/W2120210041","https://openalex.org/W2123750718","https://openalex.org/W2140283251","https://openalex.org/W2142399242","https://openalex.org/W2143355494","https://openalex.org/W2148211896","https://openalex.org/W2295580398","https://openalex.org/W2320637379","https://openalex.org/W2340787257","https://openalex.org/W2611287588","https://openalex.org/W2912052665","https://openalex.org/W2987116946","https://openalex.org/W4210551624","https://openalex.org/W4229606576","https://openalex.org/W4238893454","https://openalex.org/W6630839109","https://openalex.org/W6827284577"],"related_works":["https://openalex.org/W2908369137","https://openalex.org/W2340787257","https://openalex.org/W2133873808","https://openalex.org/W2032758195","https://openalex.org/W2908449032","https://openalex.org/W2143355494","https://openalex.org/W1590593970","https://openalex.org/W2093469244","https://openalex.org/W2053590396","https://openalex.org/W1969865855","https://openalex.org/W2027214648","https://openalex.org/W2027449343","https://openalex.org/W2152221459","https://openalex.org/W2066829960","https://openalex.org/W1800460930","https://openalex.org/W1515707347","https://openalex.org/W2101806449","https://openalex.org/W2149045885","https://openalex.org/W2104886711","https://openalex.org/W2107933515"],"abstract_inverted_index":{"We":[0],"prove":[1,143],"an":[2],"essentially":[3],"tight":[4],"lower":[5,113,123],"bound":[6],"on":[7,100,160],"the":[8,36,51,65,71,109,151,161],"unbounded-error":[9],"communication":[10,37,112],"complexity":[11,38],"of":[12,39,53,56,131],"every":[13],"symmetric":[14],"function,":[15],"i.e.,":[16],"f(x,y)=D(|x\u2227y|),":[17],"where":[18,48],"D:":[19],"{0,1,\u2026,n}\u2192{0,1}":[20],"is":[21,41,50,79],"a":[22,89,95,145,157],"given":[23],"predicate":[24,73,90,147,153],"and":[25,45,136],"x,y":[26],"range":[27],"over":[28],"{0,1}":[29],"n":[30],".":[31],"Specifically,":[32],"we":[33,86,119],"show":[34,87],"that":[35,88,144],"f":[40],"between":[42],"\u0398(k/log5":[43],"n)":[44],"\u0398(k":[46],"logn),":[47],"k":[49],"number":[52],"value":[54],"changes":[55],"D":[57,74,91],"in":[58,134,138],"{0,1,\u2026,":[59],"n}.":[60],"Prior":[61],"to":[62,94,107,111,129,142,150,156],"this":[63],"work,":[64],"problem":[66,110],"was":[67],"solved":[68],"only":[69],"for":[70,115],"parity":[72,152],"(Forster":[75],"2001).":[76],"Our":[77],"proof":[78],"built":[80],"around":[81],"two":[82],"new":[83],"ideas.":[84],"First,":[85],"gives":[92],"rise":[93],"rapidly":[96],"mixing":[97],"random":[98],"walk":[99],"\u2124":[101],"2":[102],",":[103],"which":[104],"allows":[105],"us":[106],"reduce":[108],"bounds":[114,124],"\u201ctypical\u201d":[116],"predicates.":[117],"Second,":[118],"use":[120],"Paturi\u2019s":[121],"approximation":[122],"(1992),":[125],"suitably":[126],"generalized":[127],"here":[128],"clusters":[130],"real":[132],"nodes":[133],"[0,n]":[135],"interpreted":[137],"their":[139],"dual":[140],"form,":[141],"typical":[146],"behaves":[148],"analogous":[149],"with":[154],"respect":[155],"smooth":[158],"distribution":[159],"inputs.":[162]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}