{"id":"https://openalex.org/W1969550276","doi":"https://doi.org/10.1145/1374376.1374462","title":"Direct product theorems for classical communication complexity via subdistribution bounds","display_name":"Direct product theorems for classical communication complexity via subdistribution bounds","publication_year":2008,"publication_date":"2008-05-17","ids":{"openalex":"https://openalex.org/W1969550276","doi":"https://doi.org/10.1145/1374376.1374462","mag":"1969550276"},"language":"en","primary_location":{"id":"doi:10.1145/1374376.1374462","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5051676245","display_name":"Rahul Jain","orcid":"https://orcid.org/0000-0002-3649-6576"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Rahul Jain","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018075693","display_name":"Hartmut Klauck","orcid":"https://orcid.org/0000-0003-1078-4593"},"institutions":[{"id":"https://openalex.org/I114090438","display_name":"Goethe University Frankfurt","ror":"https://ror.org/04cvxnb49","country_code":"DE","type":"education","lineage":["https://openalex.org/I114090438"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Hartmut Klauck","raw_affiliation_strings":["Goethe-Universit\u00e4t, Frankfurt, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Goethe-Universit\u00e4t, Frankfurt, Germany","institution_ids":["https://openalex.org/I114090438"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017951192","display_name":"Ashwin Nayak","orcid":"https://orcid.org/0000-0001-9866-9316"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ashwin Nayak","raw_affiliation_strings":["University of Waterloo, Waterloo, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"599","last_page":"608"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10237","display_name":"Cryptography and Data Security","score":0.9980000257492065,"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/T11567","display_name":"semigroups and automata theory","score":0.9957000017166138,"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/communication-complexity","display_name":"Communication complexity","score":0.8174827098846436},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.5964314937591553},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5812599062919617},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5702974200248718},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5653409361839294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5650448799133301},{"id":"https://openalex.org/keywords/direct-product","display_name":"Direct product","score":0.5553827285766602},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5396469235420227},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5312818288803101},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.48508134484291077},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.45433738827705383},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.4196017384529114},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41083937883377075},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4032478332519531},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35085785388946533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26155245304107666},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10108983516693115}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.8174827098846436},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.5964314937591553},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5812599062919617},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5702974200248718},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5653409361839294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5650448799133301},{"id":"https://openalex.org/C58193220","wikidata":"https://www.wikidata.org/wiki/Q1778193","display_name":"Direct product","level":2,"score":0.5553827285766602},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5396469235420227},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5312818288803101},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.48508134484291077},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.45433738827705383},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.4196017384529114},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41083937883377075},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4032478332519531},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35085785388946533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26155245304107666},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10108983516693115},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"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/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1374376.1374462","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1374376.1374462","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the fortieth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8199999928474426,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1483056539","https://openalex.org/W1543584257","https://openalex.org/W1670124229","https://openalex.org/W1805653176","https://openalex.org/W1905573593","https://openalex.org/W1970259241","https://openalex.org/W1992185863","https://openalex.org/W2010631958","https://openalex.org/W2052866997","https://openalex.org/W2056216559","https://openalex.org/W2068911609","https://openalex.org/W2089797683","https://openalex.org/W2099248542","https://openalex.org/W2107917944","https://openalex.org/W2116255088","https://openalex.org/W2120210041","https://openalex.org/W2120296961","https://openalex.org/W2134146845","https://openalex.org/W2139128805","https://openalex.org/W2141585995","https://openalex.org/W2146817307","https://openalex.org/W2148211896","https://openalex.org/W2157759010","https://openalex.org/W2195836695","https://openalex.org/W2340787257","https://openalex.org/W2912956481","https://openalex.org/W2949992932","https://openalex.org/W3103450999","https://openalex.org/W3157388067","https://openalex.org/W6618458788"],"related_works":["https://openalex.org/W1513451900","https://openalex.org/W4288641573","https://openalex.org/W2045590835","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2074456199","https://openalex.org/W2963832816","https://openalex.org/W2510382851","https://openalex.org/W2010501977","https://openalex.org/W1499088670"],"abstract_inverted_index":{"A":[0],"basic":[1],"question":[2,34],"in":[3,35,62,166],"complexity":[4,72,110,124],"theory":[5],"is":[6,52,82,186],"whether":[7],"the":[8,18,25,47,56,70,79,83,86,97,105,115,119,132,135,150,174,200],"computational":[9],"resources":[10,26],"required":[11,27],"for":[12,28,69,143,158],"solving":[13],"k":[14,23],"independent":[15],"instances":[16],"of":[17,38,55,73,100,111,183,190],"same":[19,84],"problem":[20],"scale":[21],"as":[22,85],"times":[24],"one":[29],"instance.":[30],"We":[31,42,65,94],"investigate":[32],"this":[33,101],"various":[36],"models":[37],"classical":[39],"communication":[40,63,71,109,123],"complexity.":[41,64],"introduce":[43],"a":[44,53,91,167],"new":[45],"measure,":[46,88],"subdistribution":[48,80],"bound":[49,61,81,102,133],",":[50],"which":[51],"relaxation":[54],"well-studied":[57],"rectangle":[58],"or":[59],"corruption":[60],"nonetheless":[66],"show":[67,130],"that":[68,96,131],"Boolean":[74],"functions":[75],"with":[76],"constant":[77,92],"error,":[78],"latter":[87],"up":[89],"to":[90,193],"factor.":[93],"prove":[95],"one-way":[98,106],"version":[99,117],"tightly":[103],"captures":[104],"public-coin":[107,121],"randomized":[108,122],"any":[112],"relation,":[113],"and":[114,146,149,164,180],"two-way":[116,120,147,159],"bounds":[118],"from":[125],"below.":[126],"More":[127],"importantly,":[128],"we":[129],"satisfies":[134],"strong":[136],"direct":[137,152,175,201],"product":[138,141,153,176,202],"property":[139,154],"under":[140,155],"distributions":[142,157],"both":[144],"one-":[145],"protocols,":[148],"weak":[151],"arbitrary":[156],"protocols.":[160],"These":[161],"results":[162,172],"subsume":[163],"strengthen,":[165],"unified":[168],"manner,":[169],"several":[170],"recent":[171],"on":[173],"question.":[177],"The":[178],"simplicity":[179],"broad":[181],"applicability":[182],"our":[184],"technique":[185],"perhaps":[187],"an":[188],"indication":[189],"its":[191],"potential":[192],"solve":[194],"yet":[195],"more":[196],"challenging":[197],"questions":[198],"regarding":[199],"problem.":[203]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}