{"id":"https://openalex.org/W2136813926","doi":"https://doi.org/10.1109/sfcs.1993.366870","title":"On the \"log rank\"-conjecture in communication complexity","display_name":"On the \"log rank\"-conjecture in communication complexity","publication_year":2002,"publication_date":"2002-12-30","ids":{"openalex":"https://openalex.org/W2136813926","doi":"https://doi.org/10.1109/sfcs.1993.366870","mag":"2136813926"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1993.366870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1993.366870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","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/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Raz","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","Dept. of Computer Sci., Princeton Univ., NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Dept. of Computer Sci., Princeton Univ., NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052851959","display_name":"Boris Spieker","orcid":null},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"B. Spieker","raw_affiliation_strings":["Department of Applied Mathematics, University of Twente, Enschede, Netherlands","department of Applied Mathematics, University of Twente, Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, University of Twente, Enschede, Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"department of Applied Mathematics, University of Twente, Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3957,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.78125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T12149","display_name":"Nanocluster Synthesis and Applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7493167519569397},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.696444034576416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6797612905502319},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.659819483757019},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.637292742729187},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.6304038763046265},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.566469669342041},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5647242665290833},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.5407500267028809},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5306108593940735},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.49759963154792786},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.44914722442626953},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.411271333694458},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35933518409729004}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7493167519569397},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.696444034576416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6797612905502319},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.659819483757019},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.637292742729187},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.6304038763046265},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.566469669342041},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5647242665290833},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.5407500267028809},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5306108593940735},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.49759963154792786},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.44914722442626953},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.411271333694458},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35933518409729004},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/sfcs.1993.366870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1993.366870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1563039933","https://openalex.org/W1968769959","https://openalex.org/W1991253503","https://openalex.org/W1997315904","https://openalex.org/W2002501531","https://openalex.org/W2057661677","https://openalex.org/W2078732646","https://openalex.org/W2476791979","https://openalex.org/W4243402039"],"related_works":["https://openalex.org/W2035522910","https://openalex.org/W2005615533","https://openalex.org/W4243665620","https://openalex.org/W2006803815","https://openalex.org/W1945279274","https://openalex.org/W2008470896","https://openalex.org/W4377371889","https://openalex.org/W2039347386","https://openalex.org/W2113623403","https://openalex.org/W2952190127"],"abstract_inverted_index":{"We":[0,25,62,139],"show":[1],"the":[2,9,16,19,27,52,55,68,72,86,102,109,118,131,136,143,149],"existence":[3],"of":[4,12,18,21,31,42,54,67,85,105,111,142,145],"a":[5,13,35,59,98,106],"non-constant":[6],"gap":[7,100],"between":[8,38,101],"communication":[10,83],"complexity":[11,84],"function":[14],"and":[15,108],"logarithm":[17],"rank":[20,66,110],"its":[22,112],"input":[23,69],"matrix.":[24,114],"consider":[26],"following":[28],"problem:":[29],"each":[30],"two":[32,39,56],"players":[33],"gets":[34],"perfect":[36],"matching":[37],"n-element":[40],"sets":[41],"vertices.":[43],"Their":[44],"goal":[45],"is":[46,77,88,121,155],"to":[47],"decide":[48],"whether":[49],"or":[50],"not":[51],"union":[53],"matchings":[57],"forms":[58],"Hamiltonian":[60],"cycle.":[61],"prove:":[63],"(1)":[64],"The":[65,81,152],"matrix":[70],"over":[71],"reals":[73],"for":[74,130,148],"this":[75],"problem":[76,87,134],"2/sup":[78],"O(n)/.":[79],"(2)":[80],"non-deterministic":[82,137],"/spl":[89,123],"Omega/(n":[90,124],"log":[91,92,125,126],"n).":[93,127],"Our":[94],"result":[95,120,154],"also":[96],"supplies":[97],"superpolynomial":[99],"chromatic":[103],"number":[104],"graph":[107,132],"adjacency":[113],"Another":[115],"conclusion":[116],"from":[117],"second":[119,153],"an":[122,158],"Lower":[128],"bound":[129],"connectivity":[133],"in":[135],"case.":[138],"make":[140],"use":[141],"theory":[144],"group":[146],"representations":[147],"first":[150],"result.":[151],"proved":[156],"by":[157],"information":[159],"theoretic":[160],"argument.>":[161]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}