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.

Authors

Mauricio Karchmer

This author has not been identified. Look up 'Mauricio Karchmer' in Google

Ran Raz

This author has not been identified. Look up 'Ran Raz' in Google

Avi Wigderson

This author has not been identified. Look up 'Avi Wigderson' in Google