Skip to main content
SpringerLink
Log in

Fourier analysis for probabilistic communication complexity

  • Published:
computational complexity Aims and scope Submit manuscript

Abstract

We use Fourier analysis to get general lower bounds for the probabilistic communication complexity of large classes of functions. We give some examples showing how to use our method in some known cases and for some new functions.

Our main tool is an inequality by Kahn, Kalai, and Linial, derived from two lemmas of Beckner.

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

References

  1. W. Beckner, Inequalities in Fourier Analysis.Ann. Math. 102 (1975), 159–182.

    Google Scholar 

  2. L. Babai, P. Frankl, and J. Simon, Complexity classes in communication complexity. InProc. 27th Ann. IEEE Symp. Found. Comput. Sci., 1986, 337–347.

  3. M. Ben-Or and N. Linial,Collective coin flipping in randomness and computation. Tech. Rep. Leibnitz Center Report TR 87-2, Computer Science Department, Hebrew University, 1987.

  4. L. Babai, N. Nisan, and M. Szegedy, Multiparty protocols and logspace-hard pseudorandom sequences. InProc. Twenty-first Ann. ACM Symp. Theor. Comput., 1989, 1–11.

  5. J. Kahn, G. Kalai, and N. Linial, The influence of variables on boolean functions. InProc. 29th Ann. IEEE Symp. Found. Comput. Sci., 1988, 68–80.

  6. B. Kalyanasundaram and G. Schnitger, The probabilistic communication complexity of set intersection. InProc. 2nd Ann. IEEE Conf Structure in Complexity Theory, 1987, 41–49.

  7. L. Lovász,Communication complexity: A survey. Tech. Rep. Princeton University Report CS-TR-204-89, Princeton, 1989.

  8. A. Razborov, On the distributional complexity of disjointness.Theoret. Comput. Sci. 106 (1992), 385–390.

    Google Scholar 

  9. A. Yao, Some complexity questions related to distributive computing. InProc. Eleventh Ann. ACM Symp. Theor. Comput., 1979, 209–213.

  10. A. Yao, Lower bounds by probabilistic arguments. InProc. Fifteenth Ann. ACM Symp. Theor. Comput., 1983, 420–428.

Download references

Author information

Author notes

  1. Ran Raz

    Present address: Department of Applied Math., Weizmann Institute, 76100, Rehovot, Israel

Authors and Affiliations

  1. Department of Computer Science, Princeton University, Princeton, USA

    Ran Raz

Authors
  1. Ran Raz
    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

Raz, R. Fourier analysis for probabilistic communication complexity. Comput Complexity 5, 205–221 (1995). https://doi.org/10.1007/BF01206318

Download citation

  • Received:

  • Issue Date:

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

Key words

Subject classifications

Search

Navigation