Communication complexity in lattices

Ahlswede R, Cai N, Tamm U (1993)
Applied Mathematics Letters 6(6): 53-58.

Zeitschriftenaufsatz | Veröffentlicht | Deutsch
 
Download
OA
Autor/in
; ;
Abstract / Bemerkung
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.
Erscheinungsjahr
1993
Zeitschriftentitel
Applied Mathematics Letters
Band
6
Ausgabe
6
Seite(n)
53-58
ISSN
0893-9659
Page URI
https://pub.uni-bielefeld.de/record/1780521

Zitieren

Ahlswede R, Cai N, Tamm U. Communication complexity in lattices. Applied Mathematics Letters. 1993;6(6):53-58.
Ahlswede, R., Cai, N., & Tamm, U. (1993). Communication complexity in lattices. Applied Mathematics Letters, 6(6), 53-58. doi:10.1016/0893-9659(93)90078-2
Ahlswede, R., Cai, N., and Tamm, U. (1993). Communication complexity in lattices. Applied Mathematics Letters 6, 53-58.
Ahlswede, R., Cai, N., & Tamm, U., 1993. Communication complexity in lattices. Applied Mathematics Letters, 6(6), p 53-58.
R. Ahlswede, N. Cai, and U. Tamm, “Communication complexity in lattices”, Applied Mathematics Letters, vol. 6, 1993, pp. 53-58.
Ahlswede, R., Cai, N., Tamm, U.: Communication complexity in lattices. Applied Mathematics Letters. 6, 53-58 (1993).
Ahlswede, Rudolf, Cai, Ning, and Tamm, Ulrich. “Communication complexity in lattices”. Applied Mathematics Letters 6.6 (1993): 53-58.
Alle Dateien verfügbar unter der/den folgenden Lizenz(en):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Volltext(e)
Access Level
OA Open Access
Zuletzt Hochgeladen
2019-09-06T08:48:33Z
MD5 Prüfsumme
3d69df66dad2e17a5d6261dfe5cde178