Author:
Jansen Maurice,Santhanam Rahul
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference40 articles.
1. M. Agrawal, Proving lower bounds via pseudo-random generators, in: Proc. 25th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2005, pp. 92–105.
2. Primes is in P;Agrawal;Ann. of Math.,2002
3. M. Agrawal, V. Vinay, Arithmetic circuits: A chasm at depth four, in: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science, 2008, pp. 67–75.
4. The permanent requires large uniform threshold circuits;Allender;Chic. J. Theoret. Comput. Sci.,1999
5. Logarithmic advice classes;Balcázar;Theor. Comp. Sci.,1992
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献