Author:
Chen Ruiwen,Kabanets Valentine,Kolokolova Antonina,Shaltiel Ronen,Zuckerman David
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference69 articles.
1. M. Agrawal (2005). Proving lower bounds via pseudo-random generators. In Proceedings of the Twenty-Fifth Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 92–105.
2. Allender E., Hellerstein L., McCabe P., Pitassi T., Saks M.E. (2008) Minimizing Disjunctive Normal Form Formulas and AC0 Circuits Given a Truth Table. SIAM Journal on Computing 38(1): 63–84
3. Alon N., Goldreich O., Håstad J., Peralta R. (1992) Simple Constructions of Almost k−wise Independent Random Variables. Random Structures and Algorithms 3(3): 289–304
4. Andreev A.E. (1987) On a method of obtaining more than quadratic effective lower bounds for the complexity of π-schemes. Vestnik Moskovskogo Universiteta. Matematika 42(1): 70–73 English translation in Moscow University Mathematics Bulletin.
5. A.E. Andreev, J. L. Baskakov, A. E. F. Clementi & J. D. P. Rolim (1999). Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs. In Proceedings of the Twenty-Sixth International Colloquium on Automata, Languages, and Programming, 179–189.
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献