On the Hardness against Constant-Depth Linear-Size Circuits
暂无分享,去创建一个
[1] J. Håstad. Computational limitations of small-depth circuits , 1987 .
[2] Avi Wigderson,et al. P = BPP if E requires exponential circuits: derandomizing the XOR lemma , 1997, STOC '97.
[3] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[4] Lance Fortnow,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 2005, computational complexity.
[5] Christopher Umans,et al. Simple extractors for all min-entropies and a new pseudo-random generator , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[6] Peter Bro Miltersen,et al. On converting CNF to DNF , 2005, Theor. Comput. Sci..
[7] Luca Trevisan,et al. Pseudorandom generators without the XOR lemma , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[8] Christopher Umans. Pseudo-random generators for all hardnesses , 2002, STOC '02.
[9] Noam Nisan,et al. Hardness vs Randomness , 1994, J. Comput. Syst. Sci..