𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Still another rank determination of set
✍ 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