{"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}
引用次数: 3
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).<>