Author:
Meinel Christoph,Waack Stephan
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. A. Borodin, A. Razborov, R. Smolensky, On Lower Bounds for Read-k-Times Branching Programs, Computational Complexity 3(1993), pp. 1–18.
2. C. Damm, M. Krause, Ch. Meinel, St. Waack, Separating Counting Communication Complexity Classes, in: Proc. 9th STACS, Lecture Notes in Computer Science 577, Springer Verlag 1992, pp. 281–293.
3. A. Hajnal, W. Maass, G. Turan, On the Communication Complexity of Graph Problems, in: Proc. 20th ACM STOC 1988, pp. 186–191.
4. M. Krause, St. Waack, Variation Ranks of Communication Matrices and Lower Bounds for Depth Two Circuits Having Symmetric Gates with Unbounded Fanin, in: Proc. 32nd IEEE FOCS 1991, pp. 777–782.
5. S. Lokam, Spectral Methods for Matrix Rigidity with Applications to Size-Depth Tradeoffs and Communication Complexity, in: Proc. 36th IEEE FOCS 1995.