{"title":"等宽平面分支规划表征ACC^0的拟多项式大小","authors":"Kristoffer Arnsfelt Hansen","doi":"10.1109/CCC.2008.30","DOIUrl":null,"url":null,"abstract":"We revisit the computational power of constant width polynomial size planar nondeterministic branching programs. We show that they are capable of computing any function computed by a Pi<sub>2</sub> o CC<sup>0</sup> o AC<sup>0</sup> circuit in polynomial size. In the quasipolynomial size setting we obtain a characterization of ACC<sup>0</sup> by constant width planar non-deterministic branching programs.","PeriodicalId":338061,"journal":{"name":"2008 23rd Annual IEEE Conference on Computational Complexity","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size\",\"authors\":\"Kristoffer Arnsfelt Hansen\",\"doi\":\"10.1109/CCC.2008.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We revisit the computational power of constant width polynomial size planar nondeterministic branching programs. We show that they are capable of computing any function computed by a Pi<sub>2</sub> o CC<sup>0</sup> o AC<sup>0</sup> circuit in polynomial size. In the quasipolynomial size setting we obtain a characterization of ACC<sup>0</sup> by constant width planar non-deterministic branching programs.\",\"PeriodicalId\":338061,\"journal\":{\"name\":\"2008 23rd Annual IEEE Conference on Computational Complexity\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 23rd Annual IEEE Conference on Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2008.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 23rd Annual IEEE Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2008.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
摘要
我们重新讨论了等宽多项式尺寸平面不确定性分支规划的计算能力。我们证明了它们能够以多项式大小计算任何由Pi2 o CC0 o AC0电路计算的函数。在拟多项式尺寸设置下，我们用等宽平面不确定性分支规划得到了ACC0的一个表征。
Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size
We revisit the computational power of constant width polynomial size planar nondeterministic branching programs. We show that they are capable of computing any function computed by a Pi2 o CC0 o AC0 circuit in polynomial size. In the quasipolynomial size setting we obtain a characterization of ACC0 by constant width planar non-deterministic branching programs.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
