论文信息 - Communication complexity in lattices

Communication complexity in lattices

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.

[1] Rudolf Ahlswede,et al. On communication complexity of vector-valued functions , 1994, IEEE Trans. Inf. Theory.

[2] H. Wilf. Hadamard determinants Möbius functions, and the chromatic number of a graph , 1968 .

[3] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[4] Robert B. Ash,et al. Information Theory , 2020, The SAGE International Encyclopedia of Mass Media and Society.

[5] B. Lindström. Determinants on semilattices , 1969 .

[6] Wolfgang Maass,et al. On the communication complexity of graph properties , 1988, STOC '88.

[7] Ulrich Tamm,et al. Deterministic Communication Complexity of Set Intersection , 1995, Discret. Appl. Math..

[8] Bernt Lindström,et al. Communication Complexity of two Decision Problems , 1992, Discret. Appl. Math..

[9] Thomas A. Dowling,et al. Whitney Number Inequalities for Geometric Lattices , 1975 .