Go to page

Bibliographic Metadata

Restriction-Information
 The document is publicly available on the WWW.
Links
Abstract

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.

Stats