FO(<)均匀性

21st Annual IEEE Conference on Computational Complexity (CCC'06) Pub Date : 2006-07-16 DOI:10.1109/CCC.2006.20

C. Behle, K. Lange

{"title":"FO(<)均匀性","authors":"C. Behle, K. Lange","doi":"10.1109/CCC.2006.20","DOIUrl":null,"url":null,"abstract":"Uniformity notions more restrictive than the usual FO[<, +, *]-uniformity = FO[<, Bit]-uniformity are introduced. It is shown that the general framework exhibited by Barrington et al. still holds if the fan-in of the gates in the corresponding circuits is considered","PeriodicalId":325664,"journal":{"name":"21st Annual IEEE Conference on Computational Complexity (CCC'06)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"FO[<]-uniformity\",\"authors\":\"C. Behle, K. Lange\",\"doi\":\"10.1109/CCC.2006.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Uniformity notions more restrictive than the usual FO[<, +, *]-uniformity = FO[<, Bit]-uniformity are introduced. It is shown that the general framework exhibited by Barrington et al. still holds if the fan-in of the gates in the corresponding circuits is considered\",\"PeriodicalId\":325664,\"journal\":{\"name\":\"21st Annual IEEE Conference on Computational Complexity (CCC'06)\",\"volume\":\"119 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st Annual IEEE Conference on Computational Complexity (CCC'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2006.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st Annual IEEE Conference on Computational Complexity (CCC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2006.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 19

摘要

引入了比通常的FO[<， +， *]-uniformity更严格的一致性概念= FO[<， Bit]-uniformity。结果表明，如果考虑相应电路中栅极的扇入，Barrington等人展示的一般框架仍然成立

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

FO[<]-uniformity

Uniformity notions more restrictive than the usual FO[<, +, *]-uniformity = FO[<, Bit]-uniformity are introduced. It is shown that the general framework exhibited by Barrington et al. still holds if the fan-in of the gates in the corresponding circuits is considered

求助全文

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

来源期刊

21st Annual IEEE Conference on Computational Complexity (CCC'06)

自引率

0.00%

发文量

期刊最新文献

Applications of the sum-product theorem in finite fields Hardness of the covering radius problem on lattices On modular counting with polynomials A generic time hierarchy for semantic models with one bit of advice Derandomization of probabilistic auxiliary pushdown automata classes