TY  - JOUR
AB  - For two matrix operations, called quasi-direct sum and quasi-outer product, we determine their deviations from multiplicative behaviour of the rank. The second operation arises in the determination of the function table for so-called sum-type functions such as the Hamming distance. A consequence of the corresponding rank formula is, that the frequently used log rank can be a very poor bound for two-way communication complexity. Instead, as was shown in [9], a certainexponential rank gives often excellent or even optimal bounds.
DA  - 1993
DO  - 10.1007/BF01200149
KW  - Missing dimension
KW  - Quasi outer product
KW  - Exponential rank quasi direct sum
KW  - Communication complexity
KW  - Sum-type functions
LA  - eng
IS  - 4
M2  - 253
PY  - 1993
SN  - 0938-1279
SP  - 253-261
T2  - Applicable Algebra in Engineering, Communication and Computing
TI  - Rank formulas for certain products of matrices
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17749632
Y2  - 2024-11-23T11:52:00
ER  -