Super-logarithmic depth lower bounds via the direct sum in communication complexity

Mauricio Karchmer, Ran Raz, Avi Wigderson

Research output: Contribution to journalArticlepeer-review

77 Scopus citations

Abstract

Is it easier to solve two communication problems together than separately? This question is related to the complexity of the composition of boolean functions. Based on this relationship, an approach to separating NC1 from P is outlined. Furthermore, it is shown that the approach provides a new proof of the separation of monotone NC1 from monotone P.

Original languageEnglish (US)
Pages (from-to)191-204
Number of pages14
JournalComputational Complexity
Volume5
Issue number3-4
DOIs
StatePublished - Sep 1995
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computational Mathematics
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • General Mathematics

Keywords

  • Lower-bound
  • Subject classifications: 68Q15, 68Q25
  • circuit
  • complexity
  • direct-sum

Fingerprint

Dive into the research topics of 'Super-logarithmic depth lower bounds via the direct sum in communication complexity'. Together they form a unique fingerprint.

Cite this