@inproceedings{af65c99eeb544ff3b004fa282505ecc1,
title = "Super-logarithmic depth lower bounds via direct sum in communication complexity",
abstract = "The question of whether it is easier to solve two communication problems together than separately 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.",
author = "Mauricio Karchmer and Ran Raz and Avi Wigderson",
year = "1991",
language = "אנגלית",
isbn = "0818622555",
series = "Proc 6 Annu Struct Complexity Theor",
publisher = "Publ by IEEE",
pages = "299--304",
booktitle = "Proc 6 Annu Struct Complexity Theor",
note = "Proceedings of the 6th Annual Structure in Complexity Theory Conference ; Conference date: 30-06-1991 Through 03-07-1991",
}