通信复杂度直接求和的超对数深度下界

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI:10.1109/SCT.1991.160273

M. Karchmer, R. Raz, A. Wigderson

{"title":"通信复杂度直接求和的超对数深度下界","authors":"M. Karchmer, R. Raz, A. Wigderson","doi":"10.1109/SCT.1991.160273","DOIUrl":null,"url":null,"abstract":"The question of whether it is easier to solve two communication problems together rather than separately is related to the complexity of the composition of Boolean functions. Based on this relationship, an approach to separating NC/sup 1 /from P is outlined. Furthermore, it is shown that the approach provides a new proof of the separation of monotone NC/sup 1/ from monotone P.<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Super-logarithmic depth lower bounds via direct sum in communication complexity\",\"authors\":\"M. Karchmer, R. Raz, A. Wigderson\",\"doi\":\"10.1109/SCT.1991.160273\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The question of whether it is easier to solve two communication problems together rather than separately is related to the complexity of the composition of Boolean functions. Based on this relationship, an approach to separating NC/sup 1 /from P is outlined. Furthermore, it is shown that the approach provides a new proof of the separation of monotone NC/sup 1/ from monotone P.<<ETX>>\",\"PeriodicalId\":158682,\"journal\":{\"name\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCT.1991.160273\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1991.160273","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 11

摘要

是否一起解决两个通信问题比单独解决更容易的问题与布尔函数组合的复杂性有关。基于这种关系，提出了一种分离NC/sup / P的方法。此外，该方法还提供了单调NC/sup 1/与单调P.>分离的新证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

The question of whether it is easier to solve two communication problems together rather than separately is related to the complexity of the composition of Boolean functions. Based on this relationship, an approach to separating NC/sup 1 /from P is outlined. Furthermore, it is shown that the approach provides a new proof of the separation of monotone NC/sup 1/ from monotone P.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量