✦ LIBER ✦
Still another rank determination of set intersection matrices with an application in communication complexity
✍ Scribed by U. Tamm
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 415 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
✦ Synopsis
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 matrices is determined by another method of proof, which makes use of a factorization into a product of an upper and a lower triangular matrix.