Advertisement

Communication complexity and lower bounds on multilective computations

Extended abstract
  • Juraj Hromkovič
Contributed Papers Communication - Computable Real Numbers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1450)

Abstract

Communication complexity of two-party (multiparty) protocols has established itself as a successful method for proving lower bounds on the complexity of concrete problems for numerous computing models. While the relations between communication complexity and oblivious, semilective computations are usually transparent and the main difficulty is reduced to proving nontrivial lower bounds on the communication complexity of given computing problems, the situation essentially changes, if one considers non-oblivious or multilective computations. The known lower bound proofs for such computations are far from being transparent and the crucial ideas of these proofs are often hidden behind some nontrivial combinatorial analysis. The aim of this paper is to create a general framework for the use of two-party communication protocols for lower bound proofs on multilective computations. The result of this creation is not only a transparent presentation of some known lower bounds on the complexity of multilective computations on distinct computing models, but also the derivation of new nontrivial lower bounds on multilective VLSI circuits.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ab78]
    Ableson, H.: Lower bounds on information transfer in distributed computar tions, Proc. 19th IEEE FOCS, IEEE 1978, pp. 151–158.Google Scholar
  2. [AUY83]
    Aho, A.V., Ullman, J.D., Yanakakis, M.: On notions of informations transfer in VLSI circuits, Proc. 15th ACM STOC, ACM 1983, pp. 133–139.Google Scholar
  3. [BRS93]
    Borodin, A., Razborov, A., Smolensky, R.: On lower bounds for read-k-times branching programs. Computational Complexity 3 (1993), 1–18.MATHMathSciNetCrossRefGoogle Scholar
  4. [DG93]
    ďuriš, P., Galil, Z.: On the power of multiple read in chip, Information and Computation 104 (1993), pp. 277–287.MathSciNetCrossRefGoogle Scholar
  5. [DGS84]
    ďuriš, P., Galil, Z., Schnitger, G.: Lower bounds on communication complexity, Proc. 16th ACM STOC, ACM 1984, pp. 81–91.Google Scholar
  6. [DHS96]
    Dietzfelbinger, M., Hromkovič, J., Schnitger, G.: A comparison of two lower bounds methods for communication complexity, Theoretical Computer Science 168 (1996), pp. 39–51.MATHMathSciNetCrossRefGoogle Scholar
  7. [Gr91]
    Gröger, H.D.: A new partition lemma for planar graphs and its application to circuit complexity, In: Proc. FCT'91, Lecture Notes in Computer Science 529, Springer-Verlag 1991, pp. 220–229.Google Scholar
  8. [HKMW92]
    Hromkovič, J., Krause, M., Meinel, Ch., Waack, S.: Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits, Information and Computation 95 (1992), pp. 117–128.CrossRefGoogle Scholar
  9. [Hr97]
    Hromkovič, J.: Communication Complexity and Parallel Computing, EATCS Series, Springer 1997, 336p.Google Scholar
  10. [KMW89]
    Krause, M., Meinel, Ch., Waack, S.: Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines, In: Proc. Structure in Complexity Theory 1989, pp. 240–249.Google Scholar
  11. [KN97]
    Kushilevitz, E., Nisan, N.: Communication Complexity, Cambridge University Press 1997.Google Scholar
  12. [LT79]
    Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs, SIAM J. Applied Mathematics 36 (1979), pp. 177–189.MATHMathSciNetCrossRefGoogle Scholar
  13. [PZ83]
    Pudlák, P., Zák, S.: Space complexity of computations, Tech. Report, Prague 1983.Google Scholar
  14. [Ok93]
    Okolnishkova, E.A.: On lower bounds for branching programs. Siberian Advances in Mathematics 3 (1993), 152–166.MathSciNetGoogle Scholar
  15. [Sau97]
    Sauerhoff,M.: Lower bounds for randomized read-k-times branching programs. In: Proc. STACS'98, Lecture Notes in Computer Science 1373, pp. 105–115.Google Scholar
  16. [Sa84]
    Savage, J.E.: Multilective VLSI algorithms, JCSS (1984), pp. 243–273.Google Scholar
  17. [Th79]
    Thompson, C.D.: Area-time complexity for VLSI, Proc. 11th ACM STOC, ACM 1979, pp. 81–88.Google Scholar
  18. [Tu89]
    Turán, Gy.: On restricted Boolean circuits, In: Proc. FCT'89, Lecture Notes in Computer Science 380, Springer-Verlag 1989, pp. 460–469.Google Scholar
  19. [We88]
    Wegener, I.: On the complexity of branching programs and decision trees for clique funcion, J. of ACM 35 (1988), pp. 461–471.MATHMathSciNetCrossRefGoogle Scholar
  20. [Ya79]
    Yao, A.C.: Some complexity questions related to distributive computing, Proc. 11th ACM STOC, ACM 1979, pp. 209–213.Google Scholar
  21. [Ya81]
    Yao, A.C.: The entropic limitations on VLSI computations, Proc. 11th ACM STOC, ACM 1979, pp. 209–213.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Juraj Hromkovič
    • 1
  1. 1.Dept. of Computer Science IRWTH AachenAachenGermany

Personalised recommendations