语法多线性算术电路大小的下界

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) Pub Date : 2008-07-01 DOI:10.1137/070707932

R. Raz, Amir Shpilka, A. Yehudayoff

{"title":"语法多线性算术电路大小的下界","authors":"R. Raz, Amir Shpilka, A. Yehudayoff","doi":"10.1137/070707932","DOIUrl":null,"url":null,"abstract":"We construct an explicit polynomial f(x1,..., xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least Omega{n4/3 log2 n} The lower bound holds over any field.","PeriodicalId":197431,"journal":{"name":"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"67","resultStr":"{\"title\":\"A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits\",\"authors\":\"R. Raz, Amir Shpilka, A. Yehudayoff\",\"doi\":\"10.1137/070707932\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We construct an explicit polynomial f(x1,..., xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least Omega{n4/3 log2 n} The lower bound holds over any field.\",\"PeriodicalId\":197431,\"journal\":{\"name\":\"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"67\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/070707932\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/070707932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 67

摘要

我们构造一个显式多项式f(x1，…， xn)，其系数为{0,1}，使得任何计算f的语法上的多线性算术电路的大小至少为Omega{n4/3 log2 n}，下界适用于任何域。

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

查看原文本刊更多论文

A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits

We construct an explicit polynomial f(x₁,..., x_n), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least Omega{n^4/3 log² n} The lower bound holds over any field.

求助全文

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

来源期刊

48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)

自引率

0.00%

发文量