Skip to main content
SpringerLink
Log in

On the communication complexity oft-intersection problems in generalized Boolean algebras

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

We consider the following game: Two players independently choose a chain in a partially ordered set. How many bits of information have to be communicated until at least one of the players knows whether the chains have exactlyt elements in common? This model generalizes thet-intersection problem for subsets of a finite set. We establish the deterministic communication complexity in general. For the special cases of generalized Boolean algebras, we present improved nondeterministic and probabilistic protocols that are of optimal order of complexity for classes with fixed widthq.

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

  • Ahlswede R, Cai N, Zhang Z (1989) A general 4-words inequality with consequences for 2-Way communication complexity. Adv Appl Math 10:75–94

    Article  MATH  MathSciNet  Google Scholar 

  • Ahlswede R, Cai N, Tamm U (1993) Communication complexity in lattices. In: Proceedings of the 3rd Twente Workshop on Graphs and Combinatorial Optimization, Memorandum 1132, Faculty of Applied Mathematics, University of Twente, Enschede, The Netherlands, 191–194

    Google Scholar 

  • Aigner M (1979) Combinatorial theory. Springer Verlag

  • Faigle U, Turán G (1990) Communication complexity. Computing Suppl 7:141–154

    MATH  Google Scholar 

  • Kalyanasundaram B, Schnitger G (1992) The probabilistic communication complexity of set intersection. SIAM J Disc Math 54:545–557

    Article  MathSciNet  Google Scholar 

  • Lovász L (1990) Communication complexity: A survey. In: Korte B et al. (eds) Paths, Flows and VLSI-Layout Springer Verlag, 235–266

  • Mehlhorn K, Schmidt EM (1982) Las Vegas is better than determinism in VLSI and distributed computing. Proc 14th ACM STOC, 330–337

  • Orlitsky A, El Gamal A (1988) Communication complexity. In: Abu-Mostafa YS (ed) Complexity in Information Theory Springer Verlag

  • Raz R, Spieker B (1993) On the “log-rank” conjecture in communication complexity. Proc. FOCS 93, Palo Alto, 1993, 168–176

  • Tamm U (1991) Deterministic communication complexity of the set-intersection function. Preprint 91–077, SFB 343, Universität Bielefeld

  • Wilf HS (1968) Hadamard determinants, möbius functions and the chromatic number of a graph. Bull Amer Math Soc 74:960–964

    Article  MATH  MathSciNet  Google Scholar 

  • Yao AC (1979) Some complexity questions related to distributive computing. Proc 11th ACM STOC, 209–219

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500, AE Enschede, The Netherlands

    Ulrich Faigle, Walter Kern & Boris Spieker

Authors
  1. Ulrich Faigle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Kern
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Boris Spieker
    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

Faigle, U., Kern, W. & Spieker, B. On the communication complexity oft-intersection problems in generalized Boolean algebras. Mathematical Methods of Operations Research 43, 239–254 (1996). https://doi.org/10.1007/BF01680375

Download citation

  • Issue Date:

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

Key words

Search

Navigation