Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity

Submitted by smcneil on Wed, 2013-03-13 10:52
Author: 
M. Karchmer
R. Raz
A. Wigderson
Publication: 
Computational Complexity, vol. 5, no. 3-4, pp. 191-204, 1995.
Year: 
1995
Files
File: 
Journal Version (pdf)