Towards blackbox identity testing of log-variate circuits
Towards blackbox identity testing of log-variate circuits
复制标题
DOI:
10.4230/lipics.icalp.2018.54
复制
发表时间:
2018-07
期刊:
影响因子:
--
通讯作者:
Michael A. Forbes;Sumanta K Ghosh;Nitin Saxena
中科院分区:
文献类型:
--
作者:
Michael A. Forbes;Sumanta K Ghosh;Nitin Saxena
12 Derandomization of blackbox identity testing reduces to extremely special circuit models. After 13 a line of work, it is known that focusing on circuits with constant-depth and constantly many 14 variables is enough (Agrawal,Ghosh,Saxena, STOC’18) to get to general hitting-sets and circuit 15 lower bounds. This inspires us to study circuits with few variables, eg. logarithmic in the size s . 16 We give the first poly( s )-time blackbox identity test for n = O (log s ) variate sizes circuits 17 that have poly( s )-dimensional partial derivative space; eg. depth-3 diagonal circuits (or Σ ∧ Σ n ). 18 The former model is well-studied (Nisan,Wigderson, FOCS’95) but no poly( s 2 n )-time identity 19 test was known before us. We introduce the concept of cone-closed basis isolation and prove its 20 usefulness in studying log-variate circuits. It subsumes the previous notions of rank-concentration 21 studied extensively in the context of ROABP models. 22