Circuit Lower Bounds for MCSP from Local Pseudorandom Generators
暂无分享,去创建一个
[1] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .
[2] Igor S. Sergeev,et al. Complexity of computation in finite fields , 2013 .
[3] Eric Allender,et al. Power from random strings , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[4] Igor Carboni Oliveira,et al. Hardness Magnification for Natural Problems , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[5] Jin-Yi Cai,et al. Circuit minimization problem , 2000, STOC '00.
[6] Avi Wigderson,et al. Deterministic simulation of probabilistic constant depth circuits , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[7] Avishay Tal,et al. Formula lower bounds via the quantum method , 2017, STOC.
[8] Johan Hå stad. The Shrinkage Exponent of de Morgan Formulas is 2 , 1998 .
[9] Avishay Tal,et al. Shrinkage of De Morgan Formulae by Spectral Techniques , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.
[10] Avishay Tal,et al. AC0[p] Lower Bounds against MCSP via the Coin Problem , 2019, Electron. Colloquium Comput. Complex..
[11] Ingo Wegener. The Complexity of Symmetric Boolean Functions , 1987, Computation Theory and Logic.
[12] Igor Carboni Oliveira,et al. Hardness magnification near state-of-the-art lower bounds , 2019, Electron. Colloquium Comput. Complex..
[13] Igor Carboni Oliveira,et al. Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness , 2016, CCC.
[14] Russell Impagliazzo,et al. Pseudorandomness from Shrinkage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.
[15] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..
[16] Shachar Lovett,et al. Pseudorandom Generators from Polarizing Random Walks , 2018, Electron. Colloquium Comput. Complex..
[17] Luca Trevisan,et al. A Derandomized Switching Lemma and an Improved Derandomization of AC0 , 2013, 2013 IEEE Conference on Computational Complexity.
[18] Claude E. Shannon,et al. The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..
[19] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[20] Shuichi Hirahara,et al. Non-Black-Box Worst-Case to Average-Case Reductions within NP , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).
[21] Or Meir,et al. Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity , 2016, Electron. Colloquium Comput. Complex..
[22] Johan Håstad. The Shrinkage Exponent of de Morgan Formulas is 2 , 1998, SIAM J. Comput..
[23] Madhur Tulsiani,et al. Improved Pseudorandom Generators for Depth 2 Circuits , 2010, APPROX-RANDOM.
[24] Emanuele Viola,et al. Pseudorandom bits for constant depth circuits with few arbitrary symmetric gates , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[25] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[26] Rocco A. Servedio,et al. Luby-Veličković-Wigderson revisited: Improved correlation bounds and pseudorandom generators for depth-two circuits , 2018, APPROX-RANDOM.
[27] Avi Wigderson,et al. Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.
[28] Avishay Tal,et al. Tight bounds on The Fourier Spectrum of AC0 , 2017, Electron. Colloquium Comput. Complex..
[29] Boris A. Trakhtenbrot,et al. A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.
[30] Shachar Lovett,et al. Correlation bounds for poly-size AC 0 circuits with n 1-o(1) symmetric gates , 2011 .
[31] Rahul Santhanam,et al. On the Average-Case Complexity of MCSP and Its Variants , 2017, CCC.
[32] Russell Impagliazzo,et al. Learning Algorithms from Natural Proofs , 2016, CCC.
[33] Stasys Jukna,et al. Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.
[34] R. Gregory Taylor,et al. Modern computer algebra , 2002, SIGA.