Advertisement

computational complexity

, Volume 8, Issue 1, pp 21–49 | Cite as

On Randomized One-round Communication Complexity

  • I. Kremer
  • N. Nisan
  • D. Ron

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. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Verlag, Basel 1999

Authors and Affiliations

  • I. Kremer
    • 1
  • N. Nisan
    • 2
  • D. Ron
    • 3
  1. 1.Managerial Economics and Decision Science Dept., Kellogg Business School, Northwestern University, Evanston IL, USA, e-mail: idk112@casbah.acns.nwu.eduUS
  2. 2.Institute of Computer Science, Hebrew University, Jerusalem, Israel, e-mail: noam@cs.huji.ac.ilIL
  3. 3.Department of EE-Systems, Tel Aviv University, Ramat Aviv, Israel, e-mail: danar@eng.tau.ac.ilIL

Personalised recommendations