Funder
FEA URB, American University of Beirut
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. Alon, N., Ben-Eliezer, I., Krivelevich, M.: Small sample spaces cannot fool low degree polynomials. APPROX-RANDOM 2008, 266 - 275 (2008)
2. Andreev, A., Clementi, A.E., Rolim, J.D.: A new general derandomization method. J. ACM 45(1), 179–213 (1998)
3. Alon, N., Goldreich, O., Hastad, J., Peralta, R.: Simple constructions of almost k-wise independent random variables. Random Struct. Algoritm. 3(3), 289–304 (1992)
4. Bazzi, L.: Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness. Ph.D. dissertation MIT (2003)
5. Bazzi, L.: Polylogarithmic independence can fool DNF formulas. In: Proceedings of 48th Annual IEEE Symposium on Foundations of Computer Science, pp 63–73 (2007)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献