Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity

Mauricio Karchmer, Ran Raz, Avi Wigderson. Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. In Structure in Complexity Theory Conference. pages 299-304, 1991.

Abstract

Abstract is missing.