We shall consider the communication complexity introduced by Papadimitriou and Sipser . 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.
KeywordsCommunication Complexity Annual Symposium Input Word Determine Position Bisection Width
Unable to display preview. Download preview PDF.
- Abelson, Lower bounds on information transfer in distributed computations. Proc. of the 19-th Annual Symposium on Foundations of Computer Science, 1978.Google Scholar
- Lipton and Sedgewick, Lower bounds for VLSI. Proc. of the 13-th Symposium on Theory of Computing, 1981, 300–307.Google Scholar
- 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
- Papadimitriou and Sipser, Communication Complexity. Proc. of the 23-th Annual Symposium on Foundations of Computer Science, 1982, 189–195.Google Scholar
- Savage, Area — time tradeoffs for matrix multiplication and related problems in VLSI models. Proc. of the Allerton Conference, 1979.Google Scholar
- Thompson, Area-time complexity of VLSI. Proc. of the 11-th Annual Symposium on Theory of Computing, 1979, 81–88.Google Scholar
- 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
- Yao, Some complexity questions related to distributive computing. Proc. of the 11-th Annual Symposium on Theory of Computing, 1979, 209–311.Google Scholar
- Yao, The entropic limitations on VLSI computations. Proc. of the 13-th Annual Symposium on Theory of Computing, 1981, 308–311.Google Scholar