✦ LIBER ✦

On the “log rank”-conjecture in communication complexity

✍ Scribed by Ran Raz; Boris Spieker

Publisher: Springer-Verlag
Year: 1995
Tongue: English
Weight: 887 KB
Volume: 15
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01192528

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On rank vs. communication complexity

✍ Noam Nisan; Avi Wigderson 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 420 KB

On the communication complexity of polli

On the communication complexity of polling

✍ Adele A. Rescigno 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 701 KB

Lower Bounds on the Multiparty Communica

Lower Bounds on the Multiparty Communication Complexity

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

On the graph complement conjecture for m

On the graph complement conjecture for minimum semidefinite rank

✍ Lon H. Mitchell 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Still another rank determination of set

Still another rank determination of set intersection matrices with an application in communication complexity

✍ U. Tamm 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 415 KB

The set-intersection function gives the cardinality of the intersection of two sets. In order to obtain a lower bound for the communication complexity of this function, the rank of the corresponding characteristic function-value matrices was calculated in [l] and [Z]. In this note, the rank of these

On a condition for the log-rank test to

On a condition for the log-rank test to be a locally optimal rank test

✍ Seiji Nabeya 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 122 KB