发布求助
文献互助 智能选刊 最新文献

读一次公式的和和和的下界

IF 0.8 Q3 COMPUTER SCIENCE, THEORY & METHODS
ACM Transactions on Computation Theory Pub Date : 2019-04-02 DOI:10.1145/3313232
RamyaC., R. Raghavendra
{"title":"读一次公式的和和和的下界","authors":"RamyaC., R. Raghavendra","doi":"10.1145/3313232","DOIUrl":null,"url":null,"abstract":"We study limitations of polynomials computed by depth-2 circuits built over read-once formulas (ROFs). In particular: We prove a 2(n) lower bound for the sum of ROFs computing the 2n-variate polyno...","PeriodicalId":44045,"journal":{"name":"ACM Transactions on Computation Theory","volume":null,"pages":null},"PeriodicalIF":0.8000,"publicationDate":"2019-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3313232","citationCount":"3","resultStr":"{\"title\":\"Lower bounds for Sum and Sum of Products of Read-once Formulas\",\"authors\":\"RamyaC., R. Raghavendra\",\"doi\":\"10.1145/3313232\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study limitations of polynomials computed by depth-2 circuits built over read-once formulas (ROFs). In particular: We prove a 2(n) lower bound for the sum of ROFs computing the 2n-variate polyno...\",\"PeriodicalId\":44045,\"journal\":{\"name\":\"ACM Transactions on Computation Theory\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.8000,\"publicationDate\":\"2019-04-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1145/3313232\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Computation Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3313232\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3313232","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 3

摘要

我们研究了基于一次读取公式(ROFs)的深度2电路计算多项式的局限性。特别地，我们证明了计算2n变量多项式的ROFs和的一个2(n)下界。
本文章由计算机程序翻译，如有差异，请以英文原文为准。
分享
查看原文 本刊更多论文
Lower bounds for Sum and Sum of Products of Read-once Formulas
We study limitations of polynomials computed by depth-2 circuits built over read-once formulas (ROFs). In particular: We prove a 2(n) lower bound for the sum of ROFs computing the 2n-variate polyno...
求助全文
通过发布文献求助，成功后即可免费获取论文全文。 去求助
来源期刊
ACM Transactions on Computation Theory
ACM Transactions on Computation Theory COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
2.30
自引率
0.00%
发文量
10
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信