NC/sup的对数空间单调分离

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

M. Grigni, M. Sipser

{"title":"NC/sup的对数空间单调分离","authors":"M. Grigni, M. Sipser","doi":"10.1109/SCT.1991.160272","DOIUrl":null,"url":null,"abstract":"It is shown that the monotone analog of logspace computation is more powerful than monotone log-depth circuits: monotone circuits for a certain function in monotone logspace require depth Omega (lg/sup 2/n). It is proved that mNC/sup 1/ not=mL. This result shows that the process of pointer jumping, i.e. following a chain of pointers to the end, cannot be simulated by a monotone NC/sup 1/ circuit. The proof is based upon the communication game method of A. Karchmer and A. Wigderson (1990).<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Monotone separation of logspace from NC/sup 1/\",\"authors\":\"M. Grigni, M. Sipser\",\"doi\":\"10.1109/SCT.1991.160272\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that the monotone analog of logspace computation is more powerful than monotone log-depth circuits: monotone circuits for a certain function in monotone logspace require depth Omega (lg/sup 2/n). It is proved that mNC/sup 1/ not=mL. This result shows that the process of pointer jumping, i.e. following a chain of pointers to the end, cannot be simulated by a monotone NC/sup 1/ circuit. The proof is based upon the communication game method of A. Karchmer and A. Wigderson (1990).<<ETX>>\",\"PeriodicalId\":158682,\"journal\":{\"name\":\"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"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.160272\",\"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.160272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

证明了对数空间计算的单调模拟比单调对数深度电路更强大:单调对数空间中某个函数的单调电路需要深度Omega (lg/sup 2/n)。证明了mNC/sup 1/ not=mL。这一结果表明，指针跳跃的过程，即跟随指针链到末端，不能用单调的NC/sup /电路来模拟。该证明基于A. Karchmer和A. Wigderson(1990)的通信博弈方法。

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

查看原文本刊更多论文

Monotone separation of logspace from NC/sup 1/

It is shown that the monotone analog of logspace computation is more powerful than monotone log-depth circuits: monotone circuits for a certain function in monotone logspace require depth Omega (lg/sup 2/n). It is proved that mNC/sup 1/ not=mL. This result shows that the process of pointer jumping, i.e. following a chain of pointers to the end, cannot be simulated by a monotone NC/sup 1/ circuit. The proof is based upon the communication game method of A. Karchmer and A. Wigderson (1990).<>

求助全文

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

来源期刊

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

自引率

0.00%

发文量