About: Log-rank conjecture

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In theoretical computer science, the log-rank conjecture states that the deterministic communication complexity of a two-party Boolean function is polynomially related to the logarithm of the rank of its input matrix. Let denote the deterministic communication complexity of a function, and let denote the rank of its input matrix (over the reals). Since every protocol using up to bits partitions into at most monochromatic rectangles, and each of these has rank at most 1, The log-rank conjecture states that is also upper-bounded by a polynomial in the log-rank: for some constant ,

Property Value
dbo:abstract
  • In theoretical computer science, the log-rank conjecture states that the deterministic communication complexity of a two-party Boolean function is polynomially related to the logarithm of the rank of its input matrix. Let denote the deterministic communication complexity of a function, and let denote the rank of its input matrix (over the reals). Since every protocol using up to bits partitions into at most monochromatic rectangles, and each of these has rank at most 1, The log-rank conjecture states that is also upper-bounded by a polynomial in the log-rank: for some constant , The best known upper bound, due to Lovett,states that The best known lower bound, due to Göös, Pitassi and Watson, states that . In other words, there exists a sequence of functions , whose log-rank goes to infinity, such that Recently, an approximate version of the conjecture has been disproved. (en)
dbo:wikiPageID
  • 61146406 (xsd:integer)
dbo:wikiPageLength
  • 3225 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1124049654 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In theoretical computer science, the log-rank conjecture states that the deterministic communication complexity of a two-party Boolean function is polynomially related to the logarithm of the rank of its input matrix. Let denote the deterministic communication complexity of a function, and let denote the rank of its input matrix (over the reals). Since every protocol using up to bits partitions into at most monochromatic rectangles, and each of these has rank at most 1, The log-rank conjecture states that is also upper-bounded by a polynomial in the log-rank: for some constant , (en)
rdfs:label
  • Log-rank conjecture (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License