Advertisement

Communication complexity

  • Juraj Hromkovič
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 172)

Abstract

We shall consider the communication complexity introduced by Papadimitriou and Sipser [4]. The hierarchy of this communication complexity is proved for both deterministic and nondeterministic models. The communication complexity hierarchy for k-way communication is also established.

Keywords

Communication Complexity Annual Symposium Input Word Determine Position Bisection Width 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Abelson, Lower bounds on information transfer in distributed computations. Proc. of the 19-th Annual Symposium on Foundations of Computer Science, 1978.Google Scholar
  2. [2]
    Lipton and Sedgewick, Lower bounds for VLSI. Proc. of the 13-th Symposium on Theory of Computing, 1981, 300–307.Google Scholar
  3. [3]
    Melhorn and Schmidt, Las Vegas is better than determinism in VLSI and distributed computing. Proc. of the 14-th Annual Symposium on Theory of Computing, 1982, 330–337.Google Scholar
  4. [4]
    Papadimitriou and Sipser, Communication Complexity. Proc. of the 23-th Annual Symposium on Foundations of Computer Science, 1982, 189–195.Google Scholar
  5. [5]
    Savage, Area — time tradeoffs for matrix multiplication and related problems in VLSI models. Proc. of the Allerton Conference, 1979.Google Scholar
  6. [6]
    Thompson, Area-time complexity of VLSI. Proc. of the 11-th Annual Symposium on Theory of Computing, 1979, 81–88.Google Scholar
  7. [7]
    Vuillemin, A combinatorial limit on the computational power of VLSI circuits. Proc. of the 11-th Annual Symposium on Foundations of Computer Science, 1980, 294–300.Google Scholar
  8. [8]
    Yao, Some complexity questions related to distributive computing. Proc. of the 11-th Annual Symposium on Theory of Computing, 1979, 209–311.Google Scholar
  9. [9]
    Yao, The entropic limitations on VLSI computations. Proc. of the 13-th Annual Symposium on Theory of Computing, 1981, 308–311.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Juraj Hromkovič
    • 1
  1. 1.Department of Theoretical CyberneticsKomensky UniversityBratislavaCzechoslovakia

Personalised recommendations