On randomized one-round communication complexity

Ilan Kremer; Noam Nisan; Dana Ron

doi:10.1007/s000370050018

On randomized one-round communication complexity

Ilan Kremer^*, Noam Nisan, Dana Ron

^*Corresponding author for this work

School of Electrical Engineering

Research output: Contribution to journal › Article › peer-review

136 Scopus citations

Abstract

We present several results regarding randomized one-round communication complexity. Our results include a connection to the VC-dimension, a study of the problem of computing the inner product of two real valued vectors, and a relation between "simultaneous" protocols and one-round protocols.

Original language	English
Pages (from-to)	21-49
Number of pages	29
Journal	Computational Complexity
Volume	8
Issue number	1
DOIs	https://doi.org/10.1007/s000370050018
State	Published - 1999

Funding

Funders	Funder number
Israeli Academy of Sciences
Israeli Ministry of Sciences
National Science Foundation	DMS-9508963
Bonfils-Stanton Foundation	92-00043

Keywords

Communication complexity
One-round and simultaneous protocols
VC-dimension

Access to Document

10.1007/s000370050018

Cite this

@article{c8fd84a1a7f24fbf9821a5f98b680e57,

title = "On randomized one-round communication complexity",

abstract = "We present several results regarding randomized one-round communication complexity. Our results include a connection to the VC-dimension, a study of the problem of computing the inner product of two real valued vectors, and a relation between {"}simultaneous{"} protocols and one-round protocols.",

keywords = "Communication complexity, One-round and simultaneous protocols, VC-dimension",

author = "Ilan Kremer and Noam Nisan and Dana Ron",

note = "Funding Information: It follows from this claim, that in at least 1− 1=8 of the sub-rows in A1[A0, the relative weight of entries with value 0 is at least 0(1 − 1=8). Since R is good, in particular, it is good-in-rows. For < 2−8, 1 − 1=8 > 1=4, and thus necessarily 0 < 1=4=(1 − 1=8) which is less than 2 1=4. 2 Acknowledgments. We would like to thank Oded Goldreich, Nati Linial, Amnon Ta-Shama and Avi Wigderson for many helpful discussions. We would also like to thank an anonymous referee for very detailed and helpful comments. Noam Nisan would like to acknowledge the support of a BSF grant 92-00043 and a Wolfeson award administered by the Israeli Academy of Sciences. Dana Ron would like to acknowledge the support of the Eshkol Fellowship administered by the Israeli Ministry of Sciences, and a National Science Foundation Postdoctoral Research Fellowship, Grant No. DMS-9508963.",

year = "1999",

doi = "10.1007/s000370050018",

language = "אנגלית",

volume = "8",

pages = "21--49",

journal = "Computational Complexity",

issn = "1016-3328",

publisher = "Birkhauser Verlag Basel",

number = "1",

}

TY - JOUR

T1 - On randomized one-round communication complexity

AU - Kremer, Ilan

AU - Nisan, Noam

AU - Ron, Dana

N1 - Funding Information: It follows from this claim, that in at least 1− 1=8 of the sub-rows in A1[A0, the relative weight of entries with value 0 is at least 0(1 − 1=8). Since R is good, in particular, it is good-in-rows. For < 2−8, 1 − 1=8 > 1=4, and thus necessarily 0 < 1=4=(1 − 1=8) which is less than 2 1=4. 2 Acknowledgments. We would like to thank Oded Goldreich, Nati Linial, Amnon Ta-Shama and Avi Wigderson for many helpful discussions. We would also like to thank an anonymous referee for very detailed and helpful comments. Noam Nisan would like to acknowledge the support of a BSF grant 92-00043 and a Wolfeson award administered by the Israeli Academy of Sciences. Dana Ron would like to acknowledge the support of the Eshkol Fellowship administered by the Israeli Ministry of Sciences, and a National Science Foundation Postdoctoral Research Fellowship, Grant No. DMS-9508963.

PY - 1999

Y1 - 1999

N2 - We present several results regarding randomized one-round communication complexity. Our results include a connection to the VC-dimension, a study of the problem of computing the inner product of two real valued vectors, and a relation between "simultaneous" protocols and one-round protocols.

AB - We present several results regarding randomized one-round communication complexity. Our results include a connection to the VC-dimension, a study of the problem of computing the inner product of two real valued vectors, and a relation between "simultaneous" protocols and one-round protocols.

KW - Communication complexity

KW - One-round and simultaneous protocols

KW - VC-dimension

UR - http://www.scopus.com/inward/record.url?scp=0033434847&partnerID=8YFLogxK

U2 - 10.1007/s000370050018

DO - 10.1007/s000370050018

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0033434847

SN - 1016-3328

VL - 8

SP - 21

EP - 49

JO - Computational Complexity

JF - Computational Complexity

IS - 1

ER -

On randomized one-round communication complexity

Abstract

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this