Matthew W. Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben lee Volk
{"title":"读-k无关代数分支程序的恒等检验与下界","authors":"Matthew W. Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben lee Volk","doi":"10.1145/3170709","DOIUrl":null,"url":null,"abstract":"Read-k oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ABP). In this work, we give an exponential lower bound of exp (n/kO(k)) on the width of any read-k oblivious ABP computing some explicit multilinear polynomial f that is computed by a polynomial-size depth-3 circuit. We also study the polynomial identity testing (PIT) problem for this model and obtain a white-box subexponential-time PIT algorithm. The algorithm runs in time 2Õ(n1−1/2k−1) and needs white box access only to know the order in which the variables appear in the ABP.","PeriodicalId":198744,"journal":{"name":"ACM Transactions on Computation Theory (TOCT)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs\",\"authors\":\"Matthew W. Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben lee Volk\",\"doi\":\"10.1145/3170709\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Read-k oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ABP). In this work, we give an exponential lower bound of exp (n/kO(k)) on the width of any read-k oblivious ABP computing some explicit multilinear polynomial f that is computed by a polynomial-size depth-3 circuit. We also study the polynomial identity testing (PIT) problem for this model and obtain a white-box subexponential-time PIT algorithm. The algorithm runs in time 2Õ(n1−1/2k−1) and needs white box access only to know the order in which the variables appear in the ABP.\",\"PeriodicalId\":198744,\"journal\":{\"name\":\"ACM Transactions on Computation Theory (TOCT)\",\"volume\":\"75 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Transactions on Computation Theory (TOCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3170709\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computation Theory (TOCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3170709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs
Read-k oblivious algebraic branching programs are a natural generalization of the well-studied model of read-once oblivious algebraic branching program (ABP). In this work, we give an exponential lower bound of exp (n/kO(k)) on the width of any read-k oblivious ABP computing some explicit multilinear polynomial f that is computed by a polynomial-size depth-3 circuit. We also study the polynomial identity testing (PIT) problem for this model and obtain a white-box subexponential-time PIT algorithm. The algorithm runs in time 2Õ(n1−1/2k−1) and needs white box access only to know the order in which the variables appear in the ABP.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
