次对数一致布尔证明网

Q4 Economics, Econometrics and Finance

CESifo DICE Report Pub Date : 2011-04-02 DOI:10.4204/EPTCS.75.2

Clément Aubert

{"title":"次对数一致布尔证明网","authors":"Clément Aubert","doi":"10.4204/EPTCS.75.2","DOIUrl":null,"url":null,"abstract":"Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al. gave a logspace translation allowing us to compare their computational power as uniform complexity classes. This paper presents a novel translation in AC0 and focuses on a simpler restricted notion of uniform Boolean proof nets. We can then encode constant-depth circuits and compare complexity classes below logspace, which were out of reach with the previous translations.","PeriodicalId":35380,"journal":{"name":"CESifo DICE Report","volume":"25 1","pages":"15-27"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Sublogarithmic uniform Boolean proof nets\",\"authors\":\"Clément Aubert\",\"doi\":\"10.4204/EPTCS.75.2\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al. gave a logspace translation allowing us to compare their computational power as uniform complexity classes. This paper presents a novel translation in AC0 and focuses on a simpler restricted notion of uniform Boolean proof nets. We can then encode constant-depth circuits and compare complexity classes below logspace, which were out of reach with the previous translations.\",\"PeriodicalId\":35380,\"journal\":{\"name\":\"CESifo DICE Report\",\"volume\":\"25 1\",\"pages\":\"15-27\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"CESifo DICE Report\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.75.2\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Economics, Econometrics and Finance\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"CESifo DICE Report","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.75.2","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Economics, Econometrics and Finance","Score":null,"Total":0}

引用次数: 4

摘要

利用“证明即程序”的对应关系，特瑞能够比较两种并行计算模型:布尔电路和乘法线性逻辑的证明网。Mogbil等人给出了一个对数空间转换，允许我们比较它们作为统一复杂性类的计算能力。本文提出了一种新的AC0转换方法，并着重讨论了一致布尔证明网的一个更简单的限制概念。然后，我们可以对恒深电路进行编码，并比较对数空间以下的复杂度类，这是以前的翻译无法实现的。

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

查看原文本刊更多论文

Sublogarithmic uniform Boolean proof nets

Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al. gave a logspace translation allowing us to compare their computational power as uniform complexity classes. This paper presents a novel translation in AC0 and focuses on a simpler restricted notion of uniform Boolean proof nets. We can then encode constant-depth circuits and compare complexity classes below logspace, which were out of reach with the previous translations.

求助全文

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

来源期刊

CESifo DICE Report Economics, Econometrics and Finance-Economics and Econometrics

自引率

0.00%

发文量