Pseudorandom Bits for Oblivious Branching Programs
暂无分享,去创建一个
[1] Pavel Pudlák,et al. Pseudorandom generators for group products: extended abstract , 2011, STOC '11.
[2] Ramprasad Saptharishi,et al. Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs , 2015, Electron. Colloquium Comput. Complex..
[3] Anindya De,et al. Pseudorandomness for Permutation and Regular Branching Programs , 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.
[4] Emanuele Viola,et al. Bounded independence plus noise fools products , 2016, Electron. Colloquium Comput. Complex..
[5] Amir Yehudayoff,et al. Arithmetic Circuits: A survey of recent results and open questions , 2010, Found. Trends Theor. Comput. Sci..
[6] Nitin Saxena,et al. Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs , 2016, Theory Comput..
[7] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[8] Richard J. Lipton,et al. A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..
[9] Amir Shpilka,et al. Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[10] Noam Nisan,et al. Pseudorandomness for network algorithms , 1994, STOC '94.
[11] Periklis A. Papakonstantinou,et al. Pseudorandomness for Read-Once Formulas , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[12] Russell Impagliazzo,et al. Pseudorandomness from Shrinkage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[13] Periklis A. Papakonstantinou,et al. How strong is Nisanʼs pseudo-random generator? , 2011, Inf. Process. Lett..
[14] Nitin Saxena,et al. Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits , 2014, SIAM J. Comput..
[15] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[16] Thomas Steinke. Pseudorandomness for Permutation Branching Programs Without the Group Theory , 2012, Electron. Colloquium Comput. Complex..
[17] Periklis A. Papakonstantinou,et al. Pseudorandomness for Linear Length Branching Programs and Stack Machines , 2012, APPROX-RANDOM.
[18] Thomas Steinke,et al. Pseudorandomness for Regular Branching Programs via Fourier Analysis , 2013, APPROX-RANDOM.
[19] Ran Raz,et al. Pseudorandom Generators for Regular Branching Programs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[20] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[21] Ramprasad Saptharishi,et al. Hitting sets for multilinear read-once algebraic branching programs, in any order , 2014, STOC.
[22] Thomas Steinke,et al. Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs , 2014, Theory Comput..