{"id":"https://openalex.org/W2963903795","doi":"https://doi.org/10.1145/3428671","title":"Inner Product and Set Disjointness","display_name":"Inner Product and Set Disjointness","publication_year":2020,"publication_date":"2020-11-25","ids":{"openalex":"https://openalex.org/W2963903795","doi":"https://doi.org/10.1145/3428671","mag":"2963903795"},"language":"en","primary_location":{"id":"doi:10.1145/3428671","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3428671","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/A5038669776","display_name":"Vladimir V. Podolskii","orcid":"https://orcid.org/0000-0001-7154-138X"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]},{"id":"https://openalex.org/I2801160905","display_name":"Steklov Mathematical Institute","ror":"https://ror.org/03zeg8w71","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2801160905","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Vladimir V. Podolskii","raw_affiliation_strings":["Steklov Mathematical Institute and Higher School of Economics, Pokrovsky Bulvar, Moscow, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Steklov Mathematical Institute and Higher School of Economics, Pokrovsky Bulvar, Moscow, Russia","institution_ids":["https://openalex.org/I118501908","https://openalex.org/I2801160905"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079755716","display_name":"Alexander A. Sherstov","orcid":"https://orcid.org/0000-0002-2488-7852"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander A. Sherstov","raw_affiliation_strings":["University of California, Los Angeles, Los Angeles, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02629182,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"12","issue":"4","first_page":"1","last_page":"28"},"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.9997000098228455,"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.9997000098228455,"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.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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7978106141090393},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.7461989521980286},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.7271907925605774},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6538084745407104},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.645948052406311},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.6299422383308411},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5655956268310547},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.44730493426322937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4198872148990631},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11946672201156616}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7978106141090393},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7461989521980286},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7271907925605774},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6538084745407104},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.645948052406311},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.6299422383308411},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5655956268310547},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.44730493426322937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4198872148990631},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11946672201156616},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3428671","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3428671","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.41999998688697815,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306151","display_name":"Alfred P. Sloan Foundation","ror":"https://ror.org/052csg198"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1531592115","https://openalex.org/W1969865855","https://openalex.org/W1972068724","https://openalex.org/W1980223785","https://openalex.org/W1985293484","https://openalex.org/W1989966214","https://openalex.org/W2007654329","https://openalex.org/W2027328186","https://openalex.org/W2036908068","https://openalex.org/W2041210515","https://openalex.org/W2044575164","https://openalex.org/W2044859592","https://openalex.org/W2070486524","https://openalex.org/W2074564146","https://openalex.org/W2079401865","https://openalex.org/W2081819660","https://openalex.org/W2107917944","https://openalex.org/W2107998050","https://openalex.org/W2116794057","https://openalex.org/W2151303208","https://openalex.org/W2172507717","https://openalex.org/W2514575731","https://openalex.org/W4229606576","https://openalex.org/W4252114072"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W1529311266","https://openalex.org/W4377371889","https://openalex.org/W2008470896","https://openalex.org/W2039347386","https://openalex.org/W2113623403","https://openalex.org/W2952190127","https://openalex.org/W2136813926"],"abstract_inverted_index":{"A":[0],"major":[1],"goal":[2],"in":[3,54],"complexity":[4,11,45],"theory":[5],"is":[6,91],"to":[7],"understand":[8],"the":[9,32,87],"communication":[10,44],"of":[12,34,89],"number-on-the-forehead":[13],"problems":[14,33,79],"f":[15],":({0,":[16],"1}":[17,23],"n":[18,28,51,61,69,94],")":[19],"k":[20,25,48,66,92],"\u2192":[21],"{0,":[22],"with":[24],">":[26,100],"log":[27,50,63,68],"parties.":[29],"We":[30],"study":[31],"inner":[35],"product":[36],"and":[37,40,74,84],"set":[38],"disjointness":[39],"determine":[41],"their":[42],"randomized":[43],"for":[46,96],"every":[47],"\u2265":[49,93],",":[52],"showing":[53],"both":[55],"cases":[56],"that":[57],"\u0398(1":[58],"+":[59,65],"\u2308log":[60],"\u2309/":[62],"\u23081":[64],"/":[67],"\u2309)":[70],"bits":[71],"are":[72],"necessary":[73],"sufficient.":[75],"In":[76],"particular,":[77],"these":[78],"admit":[80],"constant-cost":[81],"protocols":[82],"if":[83,86],"only":[85],"number":[88],"parties":[90],"\u03f5":[95,99],"some":[97],"constant":[98],"0.":[101]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}