电路下界通过Ehrenfeucht-Fraisse游戏

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

M. Koucký, C. Lautemann, S. Poloczek, D. Thérien

{"title":"电路下界通过Ehrenfeucht-Fraisse游戏","authors":"M. Koucký, C. Lautemann, S. Poloczek, D. Thérien","doi":"10.1109/CCC.2006.12","DOIUrl":null,"url":null,"abstract":"In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable by AC0 circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for general AC0 circuits","PeriodicalId":325664,"journal":{"name":"21st Annual IEEE Conference on Computational Complexity (CCC'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"Circuit lower bounds via Ehrenfeucht-Fraisse games\",\"authors\":\"M. Koucký, C. Lautemann, S. Poloczek, D. Thérien\",\"doi\":\"10.1109/CCC.2006.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable by AC0 circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for general AC0 circuits\",\"PeriodicalId\":325664,\"journal\":{\"name\":\"21st Annual IEEE Conference on Computational Complexity (CCC'06)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"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.12\",\"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.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 21

摘要

本文证明了一类可由一阶仅含两个变量的公式表示的函数与一类可由具有线性门数的AC0电路计算的函数重合。然后，我们研究了使用Ehrenfeucht-Fraisse对策来证明该类电路以及一般AC0电路下界的可行性

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

查看原文

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

本刊更多论文

Circuit lower bounds via Ehrenfeucht-Fraisse games

In this paper we prove that the class of functions expressible by first order formulas with only two variables coincides with the class of functions computable by AC0 circuits with a linear number of gates. We then investigate the feasibility of using Ehrenfeucht-Fraisse games to prove lower bounds for that class of circuits, as well as for general AC0 circuits

求助全文

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

来源期刊

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