Skip to main content
SpringerLink
Log in

A Note on Non-Deterministic Communication Complexity with Few Witnesses

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

We improve both main results of the paper ``Non-Deterministic Communication Complexity with Few Witnesses '' by M. Karchmer, I. Newman, M. Saks, and A. Wigderson, that appeared in Journal of Computer and System Sciences , Vol. 49, pp. 247—257.

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. Department of Computer Science, Eötvös University, grolmusz@cs.elte.hu, Budapest, Pázmány P. stny. 1/C, H-1117 Budapest, Hungary, HU

    Vince Grolmusz

  2. Rényi Mathematical Institute of the Hungarian Academy of Science, Reáltanoda u. 13—15, tardos@renyi.hu, H-1055 Budapest, Hungary, HU

    Gábor Tardos

Authors
  1. Vince Grolmusz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gábor Tardos
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grolmusz, V., Tardos, G. A Note on Non-Deterministic Communication Complexity with Few Witnesses . Theory Comput. Systems 36, 387–391 (2003). https://doi.org/10.1007/s00224-003-1158-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-003-1158-7

Keywords

Search

Navigation