Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates
暂无分享,去创建一个
Shachar Lovett | Avishay Tal | Pooya Hatami | Eshan Chattopadhyay | Avishay Tal | Shachar Lovett | Eshan Chattopadhyay | P. Hatami
[1] Ran Raz,et al. Oracle separation of BQP and PH , 2019, Electron. Colloquium Comput. Complex..
[2] Avishay Tal,et al. Improved pseudorandomness for unordered branching programs through local monotonicity , 2017, Electron. Colloquium Comput. Complex..
[3] A. Razborov. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition , 1987 .
[4] Amnon Ta-Shma,et al. Explicit, almost optimal, epsilon-balanced codes , 2017, Electron. Colloquium Comput. Complex..
[5] Swastik Kopparty. On the complexity of powering in finite fields , 2011, STOC '11.
[6] Daniel M. Kane. A Polylogarithmic PRG for Degree $2$ Threshold Functions in the Gaussian Setting , 2015, Computational Complexity Conference.
[7] Emanuele Viola,et al. Guest Column: correlation bounds for polynomials over {0 1} , 2009, SIGA.
[8] Shachar Lovett,et al. Pseudorandom Generators from Polarizing Random Walks , 2018, Electron. Colloquium Comput. Complex..
[9] Emanuele Viola,et al. On beating the hybrid argument , 2012, ITCS '12.
[10] R. Smolensky. On representations by low-degree polynomials , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[11] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[12] L. Isserlis. ON A FORMULA FOR THE PRODUCT-MOMENT COEFFICIENT OF ANY ORDER OF A NORMAL FREQUENCY DISTRIBUTION IN ANY NUMBER OF VARIABLES , 1918 .