๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Deterministic communication complexity of set intersection

โœ Scribed by Ulrich Tamm

Book ID
104184555
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
680 KB
Volume
61
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Still another rank determination of set
Still another rank determination of set intersection matrices with an application in communication complexity
โœ U. Tamm ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 415 KB

The set-intersection function gives the cardinality of the intersection of two sets. In order to obtain a lower bound for the communication complexity of this function, the rank of the corresponding characteristic function-value matrices was calculated in [l] and [Z]. In this note, the rank of these

Non-deterministic communication complexi
Non-deterministic communication complexity with few witnesses
โœ Mauricio Karchmer; Ilan Newman; Mike Saks; Avi Wigderson ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 582 KB

We study non-deterministic communication protocols in which no input has too many witnesses. Define nk(f) to be the minimum complexity of a non-deterministic protocol for the function fin which each input has at most k witnesses. We present two different lower bounds for nk(f). Our first result show