On relations between counting communication complexity classes

We develop upper and lower bound arguments for counting acceptance modes of communication protocols. A number of separation results for counting communication complexity classes is established. This extends the investigation of the complexity of communication between two processors in terms of complexity classes initiated by Babai et al. (Proceedings of the 27th IEEE FOCS, 1986, pp. 337-347) and continued in several papers (e.g., J. Comput. System Sci. 41 (1990) 402; 49 (1994) 247; Proceedings of the 36th IEEE FOCS, 1995, pp. 6-15). In particular, it will be shown that for all pairs of distinct primes p and q the communication complexity classes MOD p Pcc and MOD q Pcc are incomparable with regard to inclusion. The same is true for PPcc and MOD m Pcc, for any number m≥2. Moreover, non-determinism and modularity are incomparable to a large extend. On the other hand, if m=p 1 l 1 '...' p r l r is the prime decomposition of m≥ 2, then the complexity classes MOD m Pcc and MOD ρ(m) Pcc coincide, where ρ(m)=p 1 '...'p r . The results are obtained by characterizing the modular and probabilistic communication complexity in terms of the minimum rank of matrices ranging over certain equivalence classes. Methods from algebra and analytic geometry are used. This paper is the completely revised and strongly extended version of the conference paper Damm et al. (Proc. 9th Ann. STACS, pp. 281-291) where a subset of the results was presented.

[1]  Matthias Krause,et al.  Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In , 1995, Math. Syst. Theory.

[2]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[3]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[4]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[5]  Roman Smolensky.  On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[6]  Matthias Krause,et al.  Geometric arguments yield better bounds for threshold circuits and distributed computing , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[7]  Richard Beigel,et al.  Relativized Counting Classes: Relations among Thresholds, Parity, and Mods , 1991, J. Comput. Syst. Sci..

[8]  Rüdiger Reischuk,et al.  Relations between Communication Complexity Classes , 1990, J. Comput. Syst. Sci..

[9]  Rusins Freivalds,et al.  Fast Probabilistic Algorithms , 1979, MFCS.

[10]  Jacobo Torán,et al.  Complexity classes defined by counting quantifiers , 1991, JACM.

[11]  Noga Alon,et al.  Meanders and Their Applications in Lower Bounds Arguments , 1988, J. Comput. Syst. Sci..

[12]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[13]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[14]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[15]  Riaz A. Usmani.  Applied Linear Algebra , 1986 .

[16]  Satyanarayana V. Lokam.  Spectral methods for matrix rigidity with applications to size-depth tradeoffs and communication complexity , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[17]  Seinosuke Toda,et al.  On the power of generalized Mod-classes , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[18]  Andrew Chi-Chih Yao,et al.  ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[19]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[20]  Christoph Meinel,et al.  Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits , 1992, Inf. Comput..

[21]  Matthias Krause,et al.  Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[22]  Michael E. Saks,et al.  Non-Deterministic Communication Complexity with Few Witnesses , 1994, J. Comput. Syst. Sci..

[23]  Matthias Krause,et al.  On Oblivious Branching Programs of Linear Length , 1991, Inf. Comput..

[24]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1991, computational complexity.

[25]  Andrew C. Yao,et al.  Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[26]  Noga Alon,et al.  Meanders, Ramsey theory and lower bounds for branching programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).