{"id":"https://openalex.org/W1993344966","doi":"https://doi.org/10.1137/s009753970140004x","title":"One-Way Communication Complexity and the Ne\u010diporuk Lower Bound on Formula Size","display_name":"One-Way Communication Complexity and the Ne\u010diporuk Lower Bound on Formula Size","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1993344966","doi":"https://doi.org/10.1137/s009753970140004x","mag":"1993344966"},"language":"en","primary_location":{"id":"doi:10.1137/s009753970140004x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970140004x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5018075693","display_name":"Hartmut Klauck","orcid":"https://orcid.org/0000-0003-1078-4593"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Hartmut Klauck","raw_affiliation_strings":["Department of Computer Science, University of Calgary, Calgary Alberta T2N 1N4, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Calgary, Calgary Alberta T2N 1N4, Canada","institution_ids":["https://openalex.org/I168635309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018075693"],"corresponding_institution_ids":["https://openalex.org/I168635309"],"apc_list":null,"apc_paid":null,"fwci":0.558,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.79801281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"37","issue":"2","first_page":"552","last_page":"583"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9979000091552734,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8566118478775024},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7924325466156006},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6654012203216553},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6397180557250977},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6131906509399414},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5538389682769775},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.547754168510437},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4774642288684845},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47007495164871216},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.46107980608940125},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4401324987411499},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42861407995224},{"id":"https://openalex.org/keywords/quantum-information-science","display_name":"Quantum information science","score":0.42045411467552185},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.41632360219955444},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.41272178292274475},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.40264785289764404},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.375387579202652},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.32919836044311523},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23809435963630676},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10553082823753357},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.10256856679916382}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8566118478775024},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7924325466156006},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6654012203216553},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6397180557250977},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6131906509399414},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5538389682769775},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.547754168510437},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4774642288684845},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47007495164871216},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.46107980608940125},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4401324987411499},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42861407995224},{"id":"https://openalex.org/C5320026","wikidata":"https://www.wikidata.org/wiki/Q2122216","display_name":"Quantum information science","level":4,"score":0.42045411467552185},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.41632360219955444},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.41272178292274475},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.40264785289764404},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.375387579202652},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.32919836044311523},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23809435963630676},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10553082823753357},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.10256856679916382},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s009753970140004x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s009753970140004x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.8436","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8436","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://pages.cpsc.ucalgary.ca/~klauckh/./0111062.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.341.7010","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.7010","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0111062v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.495","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.495","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/cs/0111062v2.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322675","display_name":"Mitacs","ror":"https://ror.org/00cjrc276"},{"id":"https://openalex.org/F4320323366","display_name":"Goethe-Universit\u00e4t Frankfurt am Main","ror":"https://ror.org/04cvxnb49"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1513396692","https://openalex.org/W1553028765","https://openalex.org/W1577902660","https://openalex.org/W1631356911","https://openalex.org/W1839137787","https://openalex.org/W1968293918","https://openalex.org/W1975732129","https://openalex.org/W1980223785","https://openalex.org/W1986407511","https://openalex.org/W2008470071","https://openalex.org/W2016737198","https://openalex.org/W2020725861","https://openalex.org/W2028406173","https://openalex.org/W2029538739","https://openalex.org/W2041210515","https://openalex.org/W2044344951","https://openalex.org/W2072453354","https://openalex.org/W2072684000","https://openalex.org/W2075695434","https://openalex.org/W2078987146","https://openalex.org/W2080270420","https://openalex.org/W2083425572","https://openalex.org/W2086290259","https://openalex.org/W2088263428","https://openalex.org/W2089797683","https://openalex.org/W2089842783","https://openalex.org/W2093955013","https://openalex.org/W2099111195","https://openalex.org/W2101088258","https://openalex.org/W2102008187","https://openalex.org/W2116921087","https://openalex.org/W2125389627","https://openalex.org/W2129275337","https://openalex.org/W2155075753","https://openalex.org/W2160083149","https://openalex.org/W2295428206","https://openalex.org/W2337710787","https://openalex.org/W2340787257","https://openalex.org/W2398918824","https://openalex.org/W2963679101","https://openalex.org/W3121783526","https://openalex.org/W4211003473","https://openalex.org/W4238284510"],"related_works":["https://openalex.org/W2120210041","https://openalex.org/W2950910290","https://openalex.org/W4298273595","https://openalex.org/W2047754121","https://openalex.org/W4301013907","https://openalex.org/W2045590835","https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W2953001340","https://openalex.org/W2128158983"],"abstract_inverted_index":{"In":[0,36],"this":[1],"paper":[2],"the":[3,11,26,78,115,140,146],"Ne\u010diporuk":[4,141],"method":[5],"for":[6,131,163,185],"proving":[7],"lower":[8,49,102,128,152],"bounds":[9,50,153],"on":[10,51,104],"size":[12,59,67],"of":[13,20,28,80,117,139,145],"Boolean":[14],"formulas":[15,82,91,119,135],"is":[16],"reformulated":[17],"in":[18,143],"terms":[19,144],"one-way":[21,44,159,176,182],"communication":[22,45,168,177,183],"complexity.":[23],"We":[24,63],"investigate":[25],"settings":[27],"probabilistic":[29,134],"formulas,":[30,32,73],"nondeterministic":[31,81,87,90,165],"and":[33,71,89,99,121,133,160,166,170],"quantum":[34,105,118,132,167,175],"formulas.":[35],"all":[37],"cases":[38],"we":[39,109,154,171],"can":[40],"use":[41],"results":[42,56],"about":[43],"complexity":[46,178,184],"to":[47,86,94],"prove":[48],"formula":[52,58,106],"size.":[53,107],"The":[54,127],"main":[55],"regarding":[57],"are":[60],"as":[61],"follows:":[62],"show":[64,155,172],"a":[65,74,100,111,137],"polynomial":[66,112],"gap":[68,76],"between":[69,77,114,158],"probabilistic/quantum":[70],"deterministic":[72,181],"near-quadratic":[75,101],"sizes":[79,116],"with":[83,92,120],"limited":[84,164],"access":[85,93],"bits":[88],"slightly":[95],"more":[96],"such":[97],"bits,":[98],"bound":[103,129,142],"Furthermore":[108],"give":[110],"separation":[113],"without":[122],"multiple":[123],"read":[124],"random":[125],"inputs.":[126],"methods":[130],"employ":[136],"variant":[138],"Vapnik\u2013Chervonenkis":[147],"dimension.":[148],"To":[149],"establish":[150],"our":[151],"optimal":[156],"separations":[157],"two-way":[161],"protocols":[162],"complexity,":[169],"that":[173],"zero-error":[174],"asymptotically":[179],"equals":[180],"total":[186],"functions.":[187]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":19},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}