TY  - JOUR
AB  - The communcation complexity of functions defined in lattices is bounded from above and below, hereby generalizing former results of Lovasz [1] and Ahlswede and Cai [2]. Especially in geometric lattices, upper and lower bound often differ by at most one bit.
DA  - 1993
DO  - 10.1016/0893-9659(93)90078-2
LA  - ger
IS  - 6
M2  - 53
PY  - 1993
SN  - 0893-9659
SP  - 53-58
T2  - Applied Mathematics Letters
TI  - Communication complexity in lattices
UR  - https://nbn-resolving.org/urn:nbn:de:0070-pub-17805211
Y2  - 2024-11-21T19:19:27
ER  -