{"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}
引用次数: 3
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...