Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference27 articles.
1. E. Allender, A note on the power of threshold circuits, in: Proceedings of the 30th Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp. 580–584.
2. N. Alon, R. Beigel, Lower bounds for approximations by low degree polynomials over Zm, in: Sixteenth Annual IEEE Conference on Computational Complexity, IEEE Computer Society Press, Silver Spring, MD, 2001, pp. 184–187.
3. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs;Babai;J. Comput. System Sci.,1992
4. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1;Barrington;J. Comput. System Sci.,1989
5. Complex polynomials and circuit lower bounds for modular counting;Barrington;Comput. Complexity,1994
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献