[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

On the distributional complexity of disjointness

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 443))

Included in the following conference series:

Abstract

We prove that the distributional communication complexity of the predicate "DISJOINTNESS" with respect to a very simple measure on inputs is Ω(n).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.Babai, P.Frankl, J.Simon, "Complexity classes in communication complexity theory" — Proc. 27th IEEE FOCS, 1986, p. 337–347.

    Google Scholar 

  2. Kalyanasundaram B., Schnitger G., "The Probabilistic Communication Complexity of Set Intersection", Proc. of Second Ann. Conf. on Structure in Complexity Theory, 1987, 41–49.

    Google Scholar 

  3. Yao A.C. "Some Complexity Questions Related to Distributed Computing", Proc. 11th ACM STOC 1979, p.209–213.

    Google Scholar 

  4. Yao A.C. "Lower Bounds by Probabilistic Arguments", Proc. 24th IEEE FOCS, 1983, 420–428.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Steklov Mathematical Institute, Vavilova, 42, GSP-1, 117966, Moscow, USSR

    A. A. Razborov

Authors
  1. A. A. Razborov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Razborov, A.A. (1990). On the distributional complexity of disjointness. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032036

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52826-5

  • Online ISBN: 978-3-540-47159-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation