Super-logarithmic depth lower bounds via the direct sum in communication complexity
type: Item
instance of: scholarly article
title: Super-logarithmic depth lower bounds via the direct sum in communication complexity
zbMATH Open document ID: 0851.68034
DOI: 10.1007/BF01206317
author: Mauricio Karchmer
author: Ran Raz
author: A. Wigderson
published in: Computational Complexity
publication date: 1996-11-10T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 907995
zbMATH Keywords: complexity
zbMATH Keywords: communication problems
MaRDI profile type: Publication
cites work: A method for obtaining more than quadratic effective lower estimates of complexity of \(\pi\) schemes
cites work: On the complexity of 2-output Boolean networks
cites work: Method of determining lower bounds for the complexity of \(\Pi\)-circuits
cites work: On incidence matrices of finite projective and affine spaces
cites work: Monotone Circuits for Connectivity Require Super-Logarithmic Depth
cites work: Applications of matrix methods to the theory of lower bounds in computational complexity
description: scientific article; zbMATH DE number 907995