Super--Logarithmic Depth Lower Bounds via Direct Sum in Communication Complexity

Submitted by smcneil on Mon, 2012-01-16 00:00
Author: 
M. Karchmer
R. Raz
A. Wigderson
Publication: 
Computational Complexity, vol. 5, pp. 191-204, 1995.
Preliminary version Proceedings of the 6th Structures in Complexity Theory conference, pp. 299-304, July 1991.
Year: 
1991
Abstract: 
http://www.math.ias.edu/~avi/PUBLICATIONS/ABSTRACT/krw95.pdf
Hide Files
File: 
Journal version (pdf)
Journal version (ps)