Skip to main content
SpringerLink
Log in

On Randomized One-round Communication Complexity

  • Published:
computational complexity Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Managerial Economics and Decision Science Dept., Kellogg Business School, Northwestern University, Evanston IL, USA, e-mail: idk112@casbah.acns.nwu.edu, , , , , , US

    I. Kremer

  2. Institute of Computer Science, Hebrew University, Jerusalem, Israel, e-mail: noam@cs.huji.ac.il, , , , , , IL

    N. Nisan

  3. Department of EE-Systems, Tel Aviv University, Ramat Aviv, Israel, e-mail: danar@eng.tau.ac.il, , , , , , IL

    D. Ron

Authors
  1. I. Kremer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Nisan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Ron
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: May 2, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kremer, I., Nisan, N. & Ron, D. On Randomized One-round Communication Complexity. Comput. complex. 8, 21–49 (1999). https://doi.org/10.1007/s000370050018

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000370050018

Search

Navigation