{"id":"https://openalex.org/W1512535452","doi":"https://doi.org/10.1007/978-3-540-45077-1_16","title":"One-Way Communication Complexity of Symmetric Boolean Functions","display_name":"One-Way Communication Complexity of Symmetric Boolean Functions","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1512535452","doi":"https://doi.org/10.1007/978-3-540-45077-1_16","mag":"1512535452"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-45077-1_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-45077-1_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ita:2005037.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086010026","display_name":"Jan Arpe","orcid":null},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jan Arpe","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck,","institution_ids":["https://openalex.org/I9341345"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053904278","display_name":"Andreas Jakoby","orcid":null},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Jakoby","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck,","institution_ids":["https://openalex.org/I9341345"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001544783","display_name":"Maciej Li\u015bkiewicz","orcid":"https://orcid.org/0000-0003-0059-5086"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maciej Li\u015bkiewicz","raw_affiliation_strings":["Institut f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische Informatik, Universit\u00e4t zu L\u00fcbeck,","institution_ids":["https://openalex.org/I9341345"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9341345"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04443451,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"39","issue":"4","first_page":"158","last_page":"170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9987999796867371,"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.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6200991868972778},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5694776773452759},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5266114473342896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49448204040527344},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42716100811958313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42637431621551514},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.3978838324546814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3948427140712738},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3535957932472229}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6200991868972778},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5694776773452759},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5266114473342896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49448204040527344},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42716100811958313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42637431621551514},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.3978838324546814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3948427140712738},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3535957932472229}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/978-3-540-45077-1_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-45077-1_16","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"doi:10.1051/ita:2005037","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ita:2005037","pdf_url":null,"source":{"id":"https://openalex.org/S6941720","display_name":"RAIRO - Theoretical Informatics and Applications","issn_l":"0988-3754","issn":["0988-3754","1290-385X","2804-7346"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Theoretical Informatics and Applications","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:ITA_2005__39_4_687_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ita:2005037/","pdf_url":"https://www.numdam.org/item/10.1051/ita:2005037.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.430.2119","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.430.2119","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/2003/083/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.8.7078","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.8.7078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tcs.uni-luebeck.de/Forschung/A0304.ps","raw_type":"text"},{"id":"mag:1512535452","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc10.html#ECCC-TR03-083","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":{"id":"pmh:oai:numdam.org:ITA_2005__39_4_687_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ita:2005037/","pdf_url":"https://www.numdam.org/item/10.1051/ita:2005037.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W1512535452.pdf"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W190181624","https://openalex.org/W605043455","https://openalex.org/W1517585663","https://openalex.org/W1531381863","https://openalex.org/W1551614270","https://openalex.org/W1554101881","https://openalex.org/W1587602953","https://openalex.org/W1817451992","https://openalex.org/W1997315904","https://openalex.org/W2000356135","https://openalex.org/W2002501531","https://openalex.org/W2026480251","https://openalex.org/W2027214648","https://openalex.org/W2077968161","https://openalex.org/W2083425572","https://openalex.org/W2089797683","https://openalex.org/W2142151475","https://openalex.org/W2319645837","https://openalex.org/W2340787257","https://openalex.org/W4211003473"],"related_works":["https://openalex.org/W1587602953","https://openalex.org/W2074932744","https://openalex.org/W3194134751","https://openalex.org/W2327693269","https://openalex.org/W1592370863","https://openalex.org/W2080423274","https://openalex.org/W1926436803","https://openalex.org/W2024743439","https://openalex.org/W1992185863","https://openalex.org/W1481719945","https://openalex.org/W2796205655","https://openalex.org/W2011429979","https://openalex.org/W2968960252","https://openalex.org/W162089162","https://openalex.org/W1548701279","https://openalex.org/W58076550","https://openalex.org/W2047104001","https://openalex.org/W2588675924","https://openalex.org/W2949482466","https://openalex.org/W2093859871"],"abstract_inverted_index":{"We":[0],"study":[1],"deterministic":[2],"one-way":[3,24,101],"communication":[4,10,26,40,47,74,104],"complexity":[5,27,105],"of":[6,15,28,38,120],"functions":[7,95,109],"with":[8,79],"Hankel":[9],"matrices.":[11],"Some":[12],"structural":[13],"properties":[14],"such":[16],"matrices":[17],"are":[18,110],"established":[19],"and":[20,102],"applied":[21],"to":[22,59,70,83,117],"the":[23,36,46,73,77,80,84,118],"two-party":[25],"symmetric":[29,107],"Boolean":[30,94,108],"functions.":[31],"It":[32],"is":[33,65],"shown":[34],"that":[35,50],"number":[37],"required":[39],"bits":[41],"does":[42],"not":[43,90],"depend":[44],"on":[45],"direction,":[48],"provided":[49],"neither":[51],"direction":[52,75],"needs":[53],"maximum":[54],"complexity.":[55],"Moreover,":[56],"in":[57,66,96],"order":[58],"obtain":[60],"an":[61],"optimal":[62],"protocol,":[63],"it":[64],"any":[67],"case":[68,119],"sufficient":[69],"consider":[71],"only":[72],"from":[76],"party":[78],"shorter":[81],"input":[82],"other":[85],"party.":[86],"These":[87],"facts":[88],"do":[89],"hold":[91],"for":[92,106],"arbitrary":[93],"general.":[97],"Next,":[98],"gaps":[99],"between":[100],"two-way":[103],"discussed.":[111],"Finally,":[112],"we":[113],"give":[114],"some":[115],"generalizations":[116],"multiple":[121],"parties.":[122]},"counts_by_year":[],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}