We study 1-round two parties communication complexity games, where private random bits are used. We observe that the existence of good protocols for such games is related to a notion of approximating the matrix that represents the function by a certain low rank matrix. This gives rise to a new notion of rank, analogous of positive rank for 1-round communication complexity. We prove that the identity matrix is non approximable by low rank matrices in this sense. As a corollary we prove that any randomized protocol for the equality function requires Ω(√n) complexity in the 1-round, private bits model, answering an open question raised by Yao . A corollary is an answer to the following graph theoretic question: Assume a graph on n vertices has a set of N = N(n) cliques and so that for each two different cliques of this set, the number of edges between them is at most 0.1 of the product of their sizes. How large can N be ? We show that N = nθ(log n) is the right of magnitude.
|Title of host publication||Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996|
|Publisher||Association for Computing Machinery|
|Number of pages||10|
|State||Published - 1 Jul 1996|
|Event||28th Annual ACM Symposium on Theory of Computing, STOC 1996 - Philadelphia, United States|
Duration: 22 May 1996 → 24 May 1996
|Name||Proceedings of the Annual ACM Symposium on Theory of Computing|
|Conference||28th Annual ACM Symposium on Theory of Computing, STOC 1996|
|Period||22/05/96 → 24/05/96|
Bibliographical notePublisher Copyright:
© 1996 ACM.
ASJC Scopus subject areas